BINARY SEARCH VS. PROLLY SEARCH

Summary from the TLDR Web Dev newsletter

Binary Search is a common search algorithm with logarithmic time complexity, often used on sorted data. Prolly Search is a faster alternative that leverages the uniform distribution of data to make more intelligent guesses than simply dividing the set in half with each iteration. However, Prolly Search is not always applicable because it relies on the assumption of uniform data distribution, and it can regress to linear time complexity in certain cases.