Yashasvi Goel
Yashasvi Goel
As a CS student, you may have already implemented it as part of your compiler’s class. But if not, then you should. LALR parsing makes syntactic sense of source code,...
Bloom filters found very rare usage until the world got more online and we hit scale. But these days, we see new applications very frequently. Chrome browser uses Bloom filters...
String matching algorithms are pervasive in software. One particularly fun one, is Rabin Karp, which is used in Plagiarism detection. Rabin Karp is relatively easy to implement. See this: [Rabin–Karp...
Ubiquitous in cell phone technology, and many other applications, Viterbi algorithm is a Dynamic Programming based algorithm that finds the most likely sequence of states.
Ever wondered, how circles are drawn on the screen, with minimal jaggedness (aliasing)? Bresenham’s elegant algorithm is at play here.
RB Trees are not algorithms, but they are famed enough, that no discussion of tantalizing DS/Algorithms is complete without discussing them. The smoothest way to see/implement RB Trees, is to...
PageRank
You know what this is.
Gayle-Shapely Algorithm This is a beautiful algorithm for fair matching. Simple, elegant and effective. In its core form, it’s also straightforward to implement. Has numerous applications. See: [Stable marriage problem](https://en.wikipedia.org/wiki/Stable_marriage_problem#Applications)