2024-05-03T12:01:23Z http://moredat.ning.com/video/video/listTagged?tag=functional&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-26:6483656:Video:4734 2012-10-26T23:56:29.420Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-8-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142026?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to…

<a href="http://moredat.ning.com/video/lecture-8-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142026?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to show a more efficient recursion code. The next example she covers is that of binary search and how recursion is used in this instance.