If you want to learn more about quantum computing, we did a series recently that started simply, looked at communications, and wrapped up with a look at Grover’s algorithm.

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) .