Lecture 15 | Programming Abstractions (Stanford)

Lecture 15 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

Julie continues to cover sorting. She begins with an example of a selection sorting code and a graphic demo of the code in progress. Thereafter, she explains the different methods available to sort different kinds of data; she also explains the pros and cons of using quadratic sorting versus linearithmic sorting.

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
• 15
• algorithms
• analysis
• big-o
• sorting
• recurrences
• mergesort
• quicksort

[VideoDax]

thank you!

[dacherx]

She explains clear enough I don't need to read all the details.

And you can download the lecture slides in pdf, and code from the course website, also higher res videos (but IMO youtube ones are adequate.) google for "stanford see programming abstraction" for the course website and material!

[agapitoflores001]

Another programming abstraction video. Nice!

[bcut]

yeah sounds like Galaga :)

[dimipeli]

She uses very pedagogical ways.

[dimipeli]

@tyebillion Hahahah

[kingpupnyc]

These lectures are amazing but it's a real shame that they couldn't upload these videos at a quality good enough to be able to read the text on the screen clearly. It defeats the purpose of having a video lecture.

[rajeshwarparsi]

Julie i really love d way u r teaching...Never thought algorithms are fun to learn.

[tyebillion]

insertion sort sounds like an 80's shoot 'em up.