All Videos Tagged sorting (MoreDat) - MoreDat 2024-04-29T18:09:27Z http://moredat.ning.com/video/video/listTagged?tag=sorting&rss=yes&xn_auth=no Lecture 16 | Programming Abstractions (Stanford) 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. Lecture 15 | Programming Abstractions (Stanford) 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. Lecture 14 | Programming Abstractions (Stanford) 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. Lecture 23 | Programming Methodology (Stanford) tag:moredat.ning.com,2012-10-23:6483656:Video:4718 2012-10-23T21:18:48.174Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-23-programming-methodology-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345141798?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami and the head TA switch places for the day. The TA explains CS106A in a nut shell and goes into detail on the topics Searching and Sorting.<br></br> <br></br> CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering… <a href="http://moredat.ning.com/video/lecture-23-programming-methodology-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345141798?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami and the head TA switch places for the day. The TA explains CS106A in a nut shell and goes into detail on the topics Searching and Sorting.<br /> <br /> CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Uses the Java programming language. Emphasis is on good programming style and the built-in facilities of the Java language.