Data structure&algorithm

• Fast Integer Multiplication Algorithm

• Growth Functions(Chapter 3)

• Recurrences and the Master's Theorem(Chapter 4)

• Heapsort(Chapter 6)

• Quicksort(Chapter 7)

• Sorting in Linear Time and Lower Bounds(Chapter 8)

• 2-3 Trees

• Hashing(Chapter 11)

• Dynamic Programming(Chapter 15)

• Amortized Time(Chapter 17)

• Elementary Graph Algorithms(Chapter 22)

• Discussion of NP Completeness and Undecidability

• balanced tree

• all kinds of sorting

• set

• table

• map

• list

• linkedlist