log in
Algorithms
Spring 2007
course
home
wiki
syllabus
notes
resources
assignments
navigation
help
.. /
. /
feb 15
homework
go over
homework due today
questions about project?
mention homework for next Thu, chap 4
divide and conquer
Basic idea : f(x) = combine( f(x/2), f(x/2) )
algorithm examples
mergesort
wikipedia:merge sort
quicksort
wikipedia:quicksort
http://alienryderflex.com/quicksort/
http://linux.wku.edu/~lamonml/algor/sort/quick.html
C code example in
quicksort
directory.
binary search (is this really "divide and conquer"?)
multiplying big integers
finding closest pairs
http://cs.marlboro.edu/
courses/
spring2007/algorithms/
notes/
feb_15
last modified Thursday February 15 2007 3:55 pm EST