A Python function that parses through a sorted list (descending order) using a binary search method to determine if an element is present. Best case O(1), worst case O(log n), and uses very low memory.
You've stumbled across the archive of the blog posts I wrote some 8 years ago or so. Feel free to peruse, through everything from code snippets that never made it to GitHub, to random ramblings about my passion for technology.
A Python function that parses through a sorted list (descending order) using a binary search method to determine if an element is present. Best case O(1), worst case O(log n), and uses very low memory.