The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...

Ever wondered what was the most efficient way to alphabetize a giant pile of books? Check out the perfect real-world algorithm for just such a task.

PhD student Timo Bingmann has created an amazing video showing sorting algorithms in action. And it's surprisingly awesome!

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...