Binary Search
Binary search is a search algorithm that efficiently locates a target value within a sorted array or list by repeatedly dividing the search interval in half and eliminating half of the remaining elements based on the comparison with the target value. It has a time complexity of O(log n) and is particularly useful for searching large datasets with logarithmic time complexity. Readers can explore binary search algorithms, variations, and applications in various contexts, such as searching, sorting, and optimization, understanding its efficiency and effectiveness in algorithm design and problem-solving.
Find Peak Element | LeetCode | JavaAdvent of Code 2023: Day 6 — flowblok’s blogFinding the Peak Elements of a ListFind the peak element if the array is circularEverything You Can Do With Python’s Bisect ModuleImplementing Red-Black Tree in Go — Part 1, The Search and Insert OperationCode Snippets in Java API DocumentationSorting AlgorithmsProgramming DigestExponential Value at Linear Cost
Comprehensive roadmap for binary-search
By roadmap.sh
All posts about binary-search