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?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/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• 16
• sorting
• quadratic
• linearithmic
• partitioning
• quicksort.
• instantiation
• errors

[agapitoflores001]

I wanna sit in this class. I wanna learn new things in programming. This is a good class.

[human417]

class is really awesome, with all those animations it's much better than the class i took at Upenn

[Raynieryful]

Somos pocos los que llegamos tan lejos jajaja.

We are few who get this far hahaha.

[phoenix7782]

@zalf1000 Reporting in, Sir!

[zalf1000]

Did no one make it this far?? lol first comment