For those looking to actually practice calculating Big O for functions, here are some useful problem sets, with answers: http://www.cs.wustl.edu/~sg/CSE241_SP0

For those looking to actually practice calculating Big O for functions, here are some useful problem sets, with answers: http://www.cs.wustl.edu/~sg/CSE241_SP08/hw.html http://www.cs.wustl.edu/~sg/CSE241_SP08/hw.html Problem set for Big O and recursion: http://www-cs-faculty.stanford.edu/~eroberts/courses/cs106b/handouts/23-section-3.pdf http://www-cs-faculty.stanford.edu/~eroberts/courses/cs106b/... (see last page) and answers: http://www-cs-faculty.stanford.edu/~eroberts/courses/cs106b/handouts/23a-section-3-solutions.pdf http://www-cs-faculty.stanford.edu/~eroberts/courses/cs106b/... I also recommend the algorithms course from ArsDigita, http://aduni.org/courses/algorithms/ http://aduni.org/courses/algorithms/