(1264 Views)

Binary Search is the most famous and simplest Searching Algorithm that searches the given list for a target element. But the only condition is that the given list should be sorted, only then you can use Binary Search for searching.

Binary search compares the search element to the middle element of the list. If the search element is greater than the middle element, then the left half or elements before the middle elements of the list is eliminated from the search space, and the search continues in the remaining right half. Else if the search element is less than the middle value, the right half or all elements after the middle element is eliminated from the search space, and the search continues in the left half. This process is repeated until the middle element is equal to the search element, or if the algorithm finds that the searched element is not in the given list at all.

8 UpvotesUpvote |
2 DownvotesDownvote |

- Insertion Sort Algorithm in Ruby [168 Views]
- Simple Bubble Sort Algorithm in Java [281 Views]
- Algorithm for Merge Sort in Java [819 Views]
- Bubble Sort Algorithm in Python [277 Views]
- Insertion Sort Algorithm in Python [320 Views]

- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [9283 Views]
- Pseudocode and Algorithm to find whether number is Armstrong Number or Not [7698 Views]
- How To Win Ludo King Game Every Time [7484 Views]
- error: Multiple commands produce error in Xcode 10 [5084 Views]
- FlowChart and Pseudocode to find Whether a Number is Even or Odd [4047 Views]