Lecture 16 | Programming abstractions (Stanford)

Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie comes to sorting, especially square and linearithmic sorting process, and then explains how to partition records reasonably Quicksort. After that it goes beyond functional templates for different sorting algorithms and also briefly deal with instantiation errors and how to fix it. Complete playlist for the course: www.youtube.com CS 106BNatural Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com



http://www.youtube.com/watch?v=y4M9IVgrVKo&hl=en

Recommend : Computer Ink