Lecture 14 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and their uses.
Complete Playlist for the Course:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69
CS 106B Course Website:
http://cs106b.stanford.edu
Stanford Center for Professional Development:
http://scpd.stanford.edu/
Stanford University:
http://www.stanford.edu/
Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/
