FilesExpand file tree

 master

/

Binary Search.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

53 lines (47 loc) · 873 Bytes

 master

/

Binary Search.java

Copy path

Top

File metadata and controls

• Code
• Blame

53 lines (47 loc) · 873 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

import java.util.Scanner;

class BinarySearch

{

public static int BS(int array[], int key, int lb, int ub)

{

if (lb>ub)

{

return -1;

}

int mid=(lb+ub)/2;

if (key<array[mid])

{

return (BS(array, key, lb, mid-1));

}

else if (key>array[mid])

{

return (BS(array, key, mid+1, ub));

}

else

{

return mid;

}

}

public static void main(String[] args)

{

Scanner input=new Scanner(System.in);

int array[]=new int[10] ;

int key;

//Input

System.out.println("Enter an array of 10 numbers : ");

for (int i=0; i<10 ;i++ )

{

array[i]=input.nextInt();

}

System.out.println("Enter the number to be searched : ");

key=input.nextInt();

int index=BS(array, key, 0, 9);

if (index!=-1)

{

System.out.println("Number found at index number : " + index);

}

else

{

System.out.println("Not found");

}

}

}