grad-algorithms

Today's date, 5/11, is coincidentally the number of the graduate-level algorithms course I took. Which course topic sounds most interesting?

• Divide and Conquer, a strategy of breaking a problem into simpler sub-problems~
• Dynamic Programming, a strategy of using the information you've already computed to produce the next result in sequence~
• The Accounting Method & similar, techniques for showing an algorithm's efficiency~
• NP-Completeness, or the hierarchies of problem difficulty and the effectiveness of our known algorithms for each type~
• Reductions, where one proves that an efficient algorithm for solving one kind of problem could be used to efficiently solve another kind~