- Binary search is a search algorithm that finds the position of a target value within a sorted array.
- Binary search is used to quickly find a value in a sorted sequence (consider a sequence an ordinary array for now).
- Using a loop.
- Using recursion.
- Access: O(1)
- Search: O(log n)
- Insertion: O(n)
- Deletion: O(n)
- O(1)
- Binary Search | Easy | Solution | Problem Description
- Search a 2D Matrix | Medium | Solution | Problem Description
- koko Eating Bananas | Medium | Solution | Problem Description
- Find Minimum in Rotated Sorted Array | Medium | Solution | Problem Description
- Search in Rotated Sorted Array | Medium | Solution
- Time Based Key-Value Store | Medium | Solution | Problem Description
- Median of Two Sorted Arrays | Hard | Solution | Problem Description
Category: Binary Search
Status: Done
Author: David Bujosa