Bifalgorithm post
Searching one by one is painfully slow. Suppose we need to find 13. Binary search checks the middle. Eliminate the half, check the new middle. We found it. Each step cuts the search in half. That's O of log N.
Searching one by one is painfully slow. Suppose we need to find 13. Binary search checks the middle. Eliminate the half, check the new middle. We found it. Eac…
Ideas in this flowchart
- Binary Search Process
- Inefficiency of Linear Search
- Binary Search Method
- Check Middle Element
- Eliminate Half
- Repeat Process
- Finding the Element
- Efficiency of Binary Search
- O(log N) Complexity
