Learned how Binary Search reduces the search space by half on every iteration. Practiced iterative and recursive implementations along with edge cases.
Key takeaways
01
Sorted array requirement
02
Low Mid High concept
03
Overflow-safe mid calculation
04
Recursive implementation
05
Time complexity O(log n)
Resources
Favorites