2024-05-03T19:12:37Z http://moredat.ning.com/video/video/listTagged?tag=algorithms&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:4471 2012-10-27T00:51:17.012Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-14-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345141931?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 14 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and…

<a href="http://moredat.ning.com/video/lecture-14-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345141931?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 14 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and their uses. tag:moredat.ning.com,2012-10-26:6483656:Video:4465 2012-10-26T23:17:17.376Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-1-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142846?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>The first lecture by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie Zelenski gives an introduction to the course, recursion, algorithms, dynamic data structures and data abstraction; she also introduced the significance of programming and gives her opinion of what makes 106B "great;" C++ is…

<a href="http://moredat.ning.com/video/lecture-1-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142846?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />The first lecture by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie Zelenski gives an introduction to the course, recursion, algorithms, dynamic data structures and data abstraction; she also introduced the significance of programming and gives her opinion of what makes 106B "great;" C++ is introduced, too.