The Power of Binary Search Binary search is ubiquitous. Even if you are not aware of it, you have most likely used some (approximate) version of binary search one way or another
Factorials and How to Compute Them I am sure you all remember the surprise you had the first time you saw a “5!” or “7!”
Matrix Multiplication and the Ingenious Strassen’s Algorithm How Divide-And-Conquer Comes to the Rescue (again)
Matchings in Bipartite Graphs and the Kőnig-Egerváry Theorem via LP Duality We discuss how we can compute Maximum Matchings in bipartite graphs, and why these are equal to Minimum Vertex Covers.