How to find element index in millions elements sorted array.
This example explains how to search elements index in large number of elementarray. here recursion technique and fast search algorithm implemented .Here we have taken a example sorted ints array and given element . Which is working fine.
import java.util.Array;
/**
**
@Mukesh Jha
*/
/**
**
@Mukesh Jha
*/
import java.util.Arrays;
public class RecursiveBinarySearch {
static int exists(int[] ints, int k) {
int[] sortedArray=ints;
int start=0;
int end=ints.length;
int key=k;
int i=recursiveBinarySearch( sortedArray, start, end, key) ;
return i;
}
public static int recursiveBinarySearch(int[] sortedArray, int start, int end, int key) {
if (start < end) {
int mid = start + (end - start) / 2;
if (key < sortedArray[mid]) {
return recursiveBinarySearch(sortedArray, start, mid, key);
} else if (key > sortedArray[mid]) {
return recursiveBinarySearch(sortedArray, mid+1, end , key);
} else {
return mid;
}
}
return -(start + 1);
}
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] ints = {9, 14,37 ,40,50, 39 };
Arrays.sort(ints);
int k= 50;
int m= exists( ints ,k) ;
if( m >=0 ) {
System.out.println("Found: " +k +" at:"+ m +" index");
}else {
System.out.println(" Not Found: " +k );
}
}
}
when you run this code. For example running to find 50 in
our array. Output will be like this.
Found: 50 at:5 index
How to find element index in millions elements sorted array.
Reviewed by Mukesh Jha
on
4:47 AM
Rating:
No comments:
Add your comment