Binary Search

×

Input the Desired Array

* Minimum Size should be 5.
* Enter space seperated integers ,Total of above size.
* For better Visualization each interger is of range (5 - 80).
* Enter a sorted array as binary seach only works on an sorted array

* Only for searching algorithms
* Enter only one value

Introduction: Binary search is a fast search algorithm with run-time complexity of Ο(log n). This search algorithm works on the principle of divide and conquer. For this algorithm to work properly, the data collection should be in the sorted form.

WORKING OF BINARY SEARCH

Step 1: For a binary search to work, it is mandatory for the target array to be sorted. We shall learn the process of binary search with a pictorial example. The following is our sorted array and let us assume that we need to search the location of value 31 using binary search.

Step 2: First, we shall determine half of the array by using this formula:
mid = low + (high - low) / 2
Here it is, 0 + (9 - 0 ) / 2 = 4 (integer value of 4.5). So, 4 is the mid of the array.

Step 3: Now we compare the value stored at location 4, with the value being searched, i.e. 31. We find that the value at location 4 is 27, which is not a match. As the value is greater than 27 and we have a sorted array, so we also know that the target value must be in the upper portion of the array.

Step 4: We change our low to mid + 1 and find the new mid value again.
low = mid + 1
mid = low + (high - low) / 2
Our new mid is 7 now. We compare the value stored at location 7 with our target value 31.

Step 5: The value stored at location 7 is not a match, rather it is more than what we are looking for. So, the value must be in the lower part from this location.

Step 6: Hence, we calculate the mid again. This time it is 5.

Step 7: We compare the value stored at location 5 with our target value. We find that it is a match.


We conclude that the target value 31 is stored at location 5. Binary search halves the searchable items and thus reduces the count of comparisons to be made to very less numbers.