Hi Friend,

Try the following code:

import java.util.*;
class BinarySearchExample{
public static void main(String[] args){
int counter=0;
int[] intArray = new int[40];
int searchValue = 0, index;
int f1, f2 = 0, f3 = 1;
for (int i = 0; i < intArray.length; i++) {
f1 = f2;
f2 = f3;
f3 = f1 + f2;
intArray[i]=f3;
System.out.println(intArray[i]);
}
System.out.print("Enter a number to search for: ");
Scanner input=new Scanner(System.in);
searchValue = input.nextInt();
index = binarySearch(intArray, searchValue);
if (index != -1) {
System.out.println("Found at index: " + index);
} else {
System.out.println("Not Found");
}
}
static int binarySearch(int[] search, int find) {
int start, end, midPt;
start = 0;
end = search.length - 1;
while (start <= end) {
midPt = (start + end) / 2;
if (search[midPt] == find) {
return midPt;
} else if (search[midPt] < find) {
start = midPt + 1;
} else {
end = midPt - 1;
}
}
return -1;
}
}

Thanks