Searching and Hashing by Ramlah Mailok

Adli Zainal

2015-08-10 01:34:42 UTC

class binarysearch{ public static void main(String[] args) { binarysearch b = new binarysearch(); int[] list = {4, 6, 8, 9, 11, 12, 18, 20}; System.out.println("binary search results :"+ b.search (list, 0, 8, 11)); } public int search(int[] array, int first, int last, int search_key){ int index; if (first > last) index = -1; else { int mid = (first + last)/2; if (search_key == array[mid]) index = mid; else if (search_key < array[mid]) index = search(array, first, mid-1, search_key); else index = search(array, mid+1, last, search_key); } return index; } }

Nurul Quratul Aini Searching

2015-08-10 02:01:08 UTC

class binarysearching{

public static void main(String[] args){
int[] list = {4, 6, 8, 9, 11, 12, 18, 20};
for (int k=0; k<11; k++);
list[k]=(2*k+1);
System.out.println ("Binary search result:" +binary_search(list,1,11,21));
}

int binary_search(int array[], int first, int last, int search_key){
int index;

if(first>last)
index=-1;
else{
int mid = (first + last)/2;
if (search_key == array[mid])
index=mid;
else
if(search_key index = binary_search(array, first, mid-1, search_key);
else
index = binary_search(array, mid+1, last, search_key);
return index;
}
}

Nur Hidayah

2015-08-10 02:01:27 UTC

class searching{

public static void main (String [] args){

searching binary = new searching();

int[] list = {4, 6, 8, 11, 12, 18, 20};

System.out.println ("Binary search result: " + binary_search(list, 1, 11, 20));
}

public int binary_search(int array[], int first, int last, int search_key) {

int index;

if (first > last)
index = -1l;
else{
int mid = (first + last) / 2;
if (search_key == array[mid])
index = mid;
else
if(search_key < array[mid])
index = binary_search(array, first, mid-1, search_key);
else
index = binary_search(array, mid+1, last, search_key);
}

return index;
}

}

bah

2015-08-10 02:05:46 UTC

class searching{

public static void main (String [] args){

searching binary = new searching();

int[] list = {4, 6, 8, 11, 12, 18, 20};

System.out.println ("Binary search result: " + binary_search(list, 1, 11, 21));

int binary_search (int array[], int first, int last, int value);

public void main(){

int list[k]= new list[10];

for (int k=0; k=11; k++)
list[k]=2*k+1;
System.out.println ("Binary search result: " + binary_search(list, 1, 11, 21));
}

int binary_search(int array[], int first, int last, int search_key) {

int index;

if (first > last)
index = -1l;
else{
int mid = (first + last) / 2;
if (search_key == array[mid])
index = mid;
else
if(search_key < array[mid])
index = binary_search(array, first, mid-1, search_key);
else
index = binary_search(array, mid+1, last, search_key);
}

}

Yasmin

2015-08-10 02:06:53 UTC

class Searching{

public static void main (String[]args){

int binary_search( int array[], int first, int last, int value);

int [] list = {4,6,8,9,11,12,18,20};

for (int k=0; k<11; k++)

list [k]= 2*k+1;

System.out.println ("binary search result:"+ binary_search(list, 1,11,21));

return 0;

}

public int binary_search (int array[], int first, int last, int search_key){

int index;

if (first > last);

index = -1;

else {

int mid = (first + last)/2;

if (search_key == array[mid])

index = mid;

else

if (search_key < array [mid])

index = binary_search(array. first, mid-1, search_key);

else

index = binary_search (array, mid+1, last, search_key);

}

return index;

}

NUR NAJIHAH

2015-08-10 02:07:00 UTC

class BinarySearching{ public static void main(String[] args) { BinarySearching b = new BinarySearching(); int[] list = {4,6,8,9,11,12,18,20}; for (int k=0; k<11; k++) list[k] = 2*+1; System.out.print("Binary search results: " + b.binary_search (list, 0, 8, 11)); } public int binary_search(int array[],int first,int last,int search_key){ int index; if (first > last) index = - 1; else{ int mid = (first + last)/2; if (search_key == array[mid]) index = mid; else if(search_key < array[mid]) index = binary_search(array,first,mid-1,search_key); else index = index_search(array,mid+1,last,search_key); } return index; } }

Zaki

2015-08-10 02:07:23 UTC

alia(searching)

2015-08-10 02:07:31 UTC

Nabil

2015-08-10 02:08:44 UTC

class binari{

int binary_search(int array[],int first, int last, int search_key);
int index;

if (first > last)
index = -1;
else{
int mid = (first+last)/2;
if(search_key == array[mid])
index = mid;
else
if(search_key index = binary_search(array,first,mid-1,search_key);
else
index = binary_search(array,mid+1,last,search_key);
}
return index;
}

public static void main(String[] args){

int[] list = {4, 6, 8, 9, 11, 12, 18, 20};

for (int k=0; k<11; k++);
list[k]=(2*k+1);
System.out.println ("Binary search result:" +binary_search(list,1,11,21));
}

Shamil

2015-08-10 02:08:57 UTC

AHMAD FIRDAUS

2015-09-30 13:09:16 UTC

class binari{

int binary_search(int array[],int first, int last, int search_key);
int index;

if (first > last)
index = -1;
else{
int mid = (first+last)/2;
if(search_key == array[mid])
index = mid;
else
if(search_keyindex = binary_search(array,first,mid-1,search_key);
else
index = binary_search(array,mid+1,last,search_key);
}
return index;
}

public static void main(String[] args){

int[] list = {4, 6, 8, 9, 11, 12, 18, 20};

for (int k=0; k<11; k++);
list[k]=(2*k+1);
System.out.println ("Binary search result:" +binary_search(list,1,11,21));
}