Binary Search Algorithm

Introduction

Binary search is a fast algorithm used to find items in a sorted list.

Steps

1. Find the middle element
2. Compare with target
3. Repeat on half of the list

Advantages

• Very efficient
• Works in O(log n)
• Widely used

Diagram

Learn more: Click here