Page 393 - CA_Blue( J )_Class10
P. 393
17 { p=i;
18 break;
19 }
20 }
21 if(p!=-1)
22 System.out.println(n + " found in index "+ p);
23 else
24 System.out.println(n + " not found");
25 }
26 }
You will get the following output:
Enter a number : 1
Enter a number : 2
Enter a number : 3
Enter a number : 4
Enter a number : 5
Enter a number : 6
Enter a number : 7
Enter a number : 8
Enter a number : 9
Enter a number : 10
Enter a number to search : 7
7 found in index 6
To input a number to search and print whether the number is present in the array or not. Take
Program 12
an array of 10 elements. (Use Binary Search technique)
1 import java.util.*;
2 class BinarySearch{
3 public static void main(){
4 Scanner sc = new Scanner(System.in);
5 int a[] = {5, 7, 9, 11, 15, 20, 30, 45, 89, 97};
6 int es,min=0,max=a.length - 1,mid=-1,pos=-1;
7 System.out.print("Element to search: ");
8 es = sc.nextInt();
9 while(min <= max)
10 {
11 mid = (min + max) / 2;
391
Arrays 391

