In today's blog, I'll introduce the concept of fingerprinting algorithms. The premise of fingerprinting is simple. Suppose that you have two objects, $x$ and $y$, and you want to quickly verify if $x = y$. If $x, y$ are drawn from some universe $U$, to determine whether $x = y$ one could . . .

The class I TA for recently began examining recursive algorithms that follow the divide-and-conquer paradigm. These algorithms are a particularly interesting subset that can involve some tricky algebra when proving asymptotic bounds. This article is intended to help those students, as well as delve a lot deeper into the rigorous . . .

I wrote this example up for a friend taking a more involved algorithms/data structures course in the next semester. She wanted to know what code would produce a big O/$\Theta$ of $\log n$, and I figured it would make a good first post for the blog! Find a . . .