Lecture 15 | Programming Abstractions (Stanford)
- Title:
- Lecture 15 | Programming Abstractions (Stanford)
- Description:
-
more » « less
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=FE6E58F856038C69CS 106B Course Website:
http://cs106b.stanford.eduStanford Center for Professional Development:
http://scpd.stanford.edu/Stanford University:
http://www.stanford.edu/Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/ - Video Language:
- English
- Duration:
- 47:20
|
N. Ueda edited English subtitles for Lecture 15 | Programming Abstractions (Stanford) | |
|
Eunjeong_Kim added a translation | |
|
|
Eunjeong_Kim added a video: Lecture 15 | Programming Abstractions (Stanford) |