2024-05-03T03:12:22Z http://moredat.ning.com/video/video/listTagged?tag=quadratic&rss=yes&xn_auth=no tag:moredat.ning.com,2012-10-27:6483656:Video:4477 2012-10-27T01:03:19.655Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-16-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345143337?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> 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…

<a href="http://moredat.ning.com/video/lecture-16-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345143337?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> 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. tag:moredat.ning.com,2012-10-27:6483656:Video:4474 2012-10-27T00:54:58.942Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-15-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142095?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 15 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> 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…

<a href="http://moredat.ning.com/video/lecture-15-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142095?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 15 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> 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.