This is the third in a series about core data structures and algorithms.
The outstanding characteristic of binary search is that it’s intuitive. Many algorithms are not, but binary search is what people — anyone, not just programmers — naturally execute when looking for an item in a sorted data set.
Continue reading One search to rule them all
This is the second in a series about core data structures and algorithms.
Considering how important sorting is to computer science and programming, it’s actually a mystery why more programmers don’t appreciate it.
Continue reading The power of sorting
This is the first in a series about core data structures and algorithms.
Many explanations of data structures focus on the implementation — and that is very important — but I’ve always found some context makes it so much easier to learn. And the trade-offs between various data structures is one of the most interesting contexts you can study.
Continue reading Hash tables distilled