CS 228 meeting -*- Outline -*-

* summary of ideas in HR chapters 12 and 13

------------------------------------------
          SUMMARY OF KEY IDEAS
     IN DATA STRUCTURES (HR 12-13)

Divide and conqueor:

	binary search
	quicksort
	binary search trees
	heapsort

Changing data structure leads to
qualitative improvement.

	binary vs. linear search
	heapsort vs. selection sort 
------------------------------------------