Algorithms

Spring 2007

course

navigation

feb 5

exercises and examples

do #4, pg 67 in class
discuss ways of making plots and numeric tools : excel, mathematica, gnuplot
graphical presentation : http://www.cs.ubc.ca/~harrison/Java/sorting-demo.html

(review) summation notation

Derive or prove the following. (The second works well with induction.)

N
∑	n = ?
n = 1

N
∑	n² = (N)(1 + N)(1 + 2N) / 6
n = 1

N
∑	2ⁿ = ?
n = 1

depending on time

selection sort, buble sort
brute-force string match

http://cs.marlboro.edu/ courses/ spring2007/algorithms/ notes/ feb_5
last modified Monday February 5 2007 11:05 am EST