(3916 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 |

- Pseudocode and Flowchart for Bubble Sort [616 Views]
- AVL Tree Implementation in C++ [978 Views]
- Python program for Selection Sort Algorithm [1178 Views]
- Bubble Sort Algorithm in C [772 Views]
- Insertion Sort Algorithm in Ruby [658 Views]

- How To Win Ludo King Game Every Time [25314 Views]
- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [23802 Views]
- Algorithm to find whether number is Armstrong Number or Not [23348 Views]
- Jio Phone hang on LOGO problem Solution - Hard Reset Jio Phone [16522 Views]
- FlowChart and Algorithm to find Whether a Number is Even or Odd [12702 Views]