Jan 27
comments on Tues homework posted; next assignment is up.
discuss divide and conquer examples :
- merge sort : O(n log(n)) ; size needed is 2*list for typical implementation
- median search (tricky)
- quick sort : O(n log(n)) ; worst case n**2, but experimentally often best; can be in place
- radix sort : O(k n) , n = list size, k = number of digits
- binary search
continue with C discussion :
- addresses, pointers, and "partial" arrays
![[paper clip]](/courses/source/wiki_images/paper_clip_tilt.png)
name last modified size
