Spring 2011

Answers to problem 0.1 : 0p1 answers .

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

sorting animations : http://www.sorting-algorithms.com/

continue with C discussion :

- addresses, pointers, and "partial" arrays

http://cs.marlboro.edu/ courses/ spring2011/algorithms/ notes/ Jan_27

last modified Thursday January 27 2011 2:49 am EST

last modified Thursday January 27 2011 2:49 am EST

name last modified size