Binary Search ↔ Algo to search element in pre-sorted Array by halving with Logarithmic Complexity
BST
tree data-struct for fast insert/search
References
bisect↔ to walk through Commit History via Binary Search to find good/bad Commits