Answered Essay: PLEASE HELP WITH THIS ASSIGNMENT ASAP!!PLEASE PROVIDE CODE TOO

PLEASE HELP WITH THIS ASSIGNMENT ASAP!!PLEASE PROVIDE CODE TOO

Write an algorithm that searches a sorted list of n items by dividing it into three sublists of almost n/3 items. This algorithm finds the sublist that might contain the given item and divides it into three smaller sublists of almost equal size. The algorithm repeats this process until it finds the item or concludes that the item is not in the list. Analyze your algorithm and give the results using order notation.

write and implement the code and test your code with the following input data.you do not need to do the analysis part of the algorithm

Input data1:4,18,25,55,62,74,83,90,95(item to search=84)

Input data2:11,17,32,46,52,54,61,76,79,81,81,83,84,91,97,99(item to search=81)

Input data3:-8,-5,-4,1,413,19,25,30,33,37,43,47,62,75,86item to search=-4)

Expert Answer

 

import java.util.*;
public class search_list {
static int data[]={4,18,25,55,62,74,83,90,95};
static List<Integer>l1=new ArrayList<Integer>();
static List<Integer>l2=new ArrayList<Integer>();
static List<Integer>l3=new ArrayList<Integer>();
static int counter=0;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(“enter element to search”);
int element=sc.nextInt();
subparts(data,element);
}
public static void subparts(int data[],int element){
int len=data.length;
int chk=len%3;
int mid=len/3;
int midp=mid+mid;

if(chk!=0){
for(int i=0;i<data.length;i++){
if(i>=0 && i<=mid){
l1.add(data[i]);
}else if(i>mid&& i<=midp){
l2.add(data[i]);
}else{
l3.add(data[i]);
}
}
}else{

for(int i=0;i<data.length;i++){
if(i<mid){
l1.add(data[i]);
}else if(i>=mid && i<midp)
{
l2.add(data[i]);
}else{
l3.add(data[i]);
}
}
}
search(l1,element);
search(l2,element);
search(l3,element);
checksearch();
}
public static void search(List<Integer> list,int element){
boolean flag=false;
String name;
for(int i=0;i<list.size();i++){
if(list.get(i)==element){
System.out.println(“element is found and hash code of list is:”+list.hashCode());
flag=true;
break;
}
}
if(flag==false)
counter++;
}
public static void checksearch(){
if(counter==3){
System.out.println(“the element does not found in list:”);
}
}
}

output:
enter element to search
4
element is found and hash code of list is:34218

enter element to search
6
the element does not found in list:
//————————————————–

import java.util.*;
public class search_list {
static int data[]={11,17,32,46,52,54,61,76,79,81,81,83,84,91,97,99};
static List<Integer>l1=new ArrayList<Integer>();
static List<Integer>l2=new ArrayList<Integer>();
static List<Integer>l3=new ArrayList<Integer>();
static int counter=0;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(“enter element to search”);
int element=sc.nextInt();
subparts(data,element);
}
public static void subparts(int data[],int element){
int len=data.length;
int chk=len%3;
int mid=len/3;
int midp=mid+mid;

if(chk!=0){
for(int i=0;i<data.length;i++){
if(i>=0 && i<=mid){
l1.add(data[i]);
}else if(i>mid&& i<=midp){
l2.add(data[i]);
}else{
l3.add(data[i]);
}
}
}else{

for(int i=0;i<data.length;i++){
if(i<mid){
l1.add(data[i]);
}else if(i>=mid && i<midp)
{
l2.add(data[i]);
}else{
l3.add(data[i]);
}
}
}
search(l1,element);
search(l2,element);
search(l3,element);
checksearch();
}
public static void search(List<Integer> list,int element){
boolean flag=false;
String name;
for(int i=0;i<list.size();i++){
if(list.get(i)==element){
System.out.println(“element is found and hash code of list is:”+list.hashCode());
flag=true;
break;
}
}
if(flag==false)
counter++;
}
public static void checksearch(){
if(counter==3){
System.out.println(“the element does not found in list:”);
}
}
}

output:
enter element to search
17
element is found and hash code of list is:1219123383

enter element to search
98
the element does not found in list:

//———————————————————

import java.util.*;
public class search_list {
static int data[]={-8,-5,-4,1,413,19,25,30,33,37,43,47,62,75,86};
static List<Integer>l1=new ArrayList<Integer>();
static List<Integer>l2=new ArrayList<Integer>();
static List<Integer>l3=new ArrayList<Integer>();
static int counter=0;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(“enter element to search”);
int element=sc.nextInt();
subparts(data,element);
}
public static void subparts(int data[],int element){
int len=data.length;
int chk=len%3;
int mid=len/3;
int midp=mid+mid;

if(chk!=0){
for(int i=0;i<data.length;i++){
if(i>=0 && i<=mid){
l1.add(data[i]);
}else if(i>mid&& i<=midp){
l2.add(data[i]);
}else{
l3.add(data[i]);
}
}
}else{

for(int i=0;i<data.length;i++){
if(i<mid){
l1.add(data[i]);
}else if(i>=mid && i<midp)
{
l2.add(data[i]);
}else{
l3.add(data[i]);
}
}
}
search(l1,element);
search(l2,element);
search(l3,element);
checksearch();
}
public static void search(List<Integer> list,int element){
boolean flag=false;
String name;
for(int i=0;i<list.size();i++){
if(list.get(i)==element){
System.out.println(“element is found and hash code of list is:”+list.hashCode());
flag=true;
break;
}
}
if(flag==false)
counter++;
}
public static void checksearch(){
if(counter==3){
System.out.println(“the element does not found in list:”);
}
}
}

output:

enter element to search
33
element is found and hash code of list is:46950715

enter element to search
-6
the element does not found in list:

/* the project contains 3 methods like
subparts,search,cheksearch
all these methods are implemented seperatly
the timecomplexity of in terms of theta
it contains only one for loop in every methods
*/

Buy Essay
Calculate your paper price
Pages (550 words)
Approximate price: -

Help Me Write My Essay - Reasons:

Best Online Essay Writing Service

We strive to give our customers the best online essay writing experience. We Make sure essays are submitted on time and all the instructions are followed.

Our Writers are Experienced and Professional

Our essay writing service is founded on professional writers who are on stand by to help you any time.

Free Revision Fo all Essays

Sometimes you may require our writers to add on a point to make your essay as customised as possible, we will give you unlimited times to do this. And we will do it for free.

Timely Essay(s)

We understand the frustrations that comes with late essays and our writers are extra careful to not violate this term. Our support team is always engauging our writers to help you have your essay ahead of time.

Customised Essays &100% Confidential

Our Online writing Service has zero torelance for plagiarised papers. We have plagiarism checking tool that generate plagiarism reports just to make sure you are satisfied.

24/7 Customer Support

Our agents are ready to help you around the clock. Please feel free to reach out and enquire about anything.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

HOW OUR ONLINE ESSAY WRITING SERVICE WORKS

Let us write that nagging essay.

STEP 1

Submit Your Essay/Homework Instructions

By clicking on the "PLACE ORDER" button, tell us your requires. Be precise for an accurate customised essay. You may also upload any reading materials where applicable.

STEP 2

Pick A & Writer

Our ordering form will provide you with a list of writers and their feedbacks. At step 2, its time select a writer. Our online agents are on stand by to help you just in case.

STEP 3

Editing (OUR PART)

At this stage, our editor will go through your essay and make sure your writer did meet all the instructions.

STEP 4

Receive your Paper

After Editing, your paper will be sent to you via email.