Schedule

Week 1
01/17 - snow day
01/19 - review

Week 2
01/22 - call stack
01/24 - the heap and pointers
01/26 - pointers and references

Week 3
01/29 - recurision - factorial
01/31 - fib
02/02 - binary search

Week 4
02/05 - binary search, sorting
02/07 - big o
02/09 - mergesort

Week 5
02/12 - quicksort
02/14 - finish sorts
02/16 - linked lists

Week 6
02/19 - append, insert
02/21 - delete
02/23 - remove, insert

Week 7
02/26 - wrap up
02/28 - exam
03/02 - templates (code)

Week 8
Spring Break

Week 9
03/12 - adt and sets
03/14 - stacks
03/16 - queues

Week 10
03/19 - deque (code)
03/21 - maps
03/23 - hash table

Week 11
03/26 - iterators (code)
03/28 - binary tree
03/30 - binary tree
Week 12
04/02 - heaps
04/04 - traversals/heaps
04/06 -
Week 13
04/09 - classes
04/11 -
04/13 - pointer review
Week 14
04/16 - inheritance
04/18 - virtual
04/20 -