LeetCode - The Search Part
This part is for search part.
- 1d search
In 1d search, we always use binary search to reduce the time complexity from O(n) into O(logn).
- 2d search
In 2d matrix, we always use the exists properties to make sure that we can search efficiently.
we can split the area into 4 part for each item in matrix. One part is definitely smaller the the item, and one part is definitely bigger than the item. So if we have a target value is bigger or smaller than the item value, we can reduce the area into a smaller area.