Algorithms

Spring 2011
course
navigation

Feb 3

homework

2.12 : see protected for numerical experiment
f(10) = 15 f(100) = 127 f(1000) = 1023 f(10000) = 16384 So ... what's the pattern? What's O(f)? Explain.
2.14 : sort O(n log(n)), then remove duplicates with O(n). Explain.
Quicksort : in place, with swaps; discuss. (See attached.)
Radix sort : describe basic ideas.

Fourier math

Describe the basic idea :
So :
Notes and exercises :
More sources :
http://cs.marlboro.edu/ courses/ spring2011/algorithms/ notes/ Feb_3
last modified Thursday February 3 2011 12:53 am EST

attachments [paper clip]

     name last modified size
[COD]quicksort.c Feb 3 2011 12:40 am 2.51kB