|
Title: Lecture 15 | Programming Abstractions (Stanford) View count: 3484 Rating: 5.0 (15 ratings) Description: 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/ Tags: computer, science, technology, software, engineering, c++, programming, language, lecture, 15, algorithms, analysis, big-o, sorting, recurrences, mergesort, quicksort, Author: StanfordUniversity |
