Binary Search in Java

#techlearners #java #searching
Binary Search
Binary search is faster than linear search. It works only on a
sorted set of elements.

List 5 6 9 19 23 32 45
Element to be searched 32

low mid high
5 6 9 19 23 32 45

Step 1: First, compare x with the middle element.

Step 2: If x matches with the middle element, then
you have to return the mid index.

if 19 == 32

Step 3: Else, If x is greater than the mid element,
then x can only lie in the right side half array after
the mid element. Hence you recur the right half.

New List - 23 32 45

Step 4: Else, if (x is smaller) then recur for the left half.

Step 5: Repeat the process till element is found or list ends.

low mid high
23 32 45

Binary Search
1. Regular Way ( with loops and conditional statements )
2. Using Recursion
3. Using binarysearch method of Array class
4. Using binarysearch method of Collection class

TECHLEARNERS BY NEERAJ SAXENA