1. Course Information

2. Algorithm Analysis Part 1-Chapter 4

3. Algorithm Analysis Part 2-Chapter 4

4. Recursion-Section 3.5

5. Merge sort - Solving recurrences

6. Quick sort

7. Arrays - Linked lists

8. Stacks

9. Queues

10. Double-ended queues - Extendable arrays

11. Trees

12. Binary trees

Reading week: February 16-22.

13. Midterm test (February 26)

14. Binary search trees