Lecture 16 | Programming Abstractions (Stanford)
Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie continues with sorting, specifically quadratic and linearithmic sorting methods, and then explains how to reasonably partition data sets for quicksort. Thereafter, she proceeds to go over different functional templates for sorting algorithms and also briefly goes over instantiation errors and how to fix them.
Complete Playlist for the Course:
http://www.youtube.com/view_play_list...
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:
/ stanforduniversity
Watch video Lecture 16 | Programming Abstractions (Stanford) online without registration, duration hours minute second in high quality. This video was added by user Stanford 16 July 2008, don't forget to share it with your friends and acquaintances, it has been viewed on our site 29,375 once and liked it 120 people.