All Videos Tagged recursively (MoreDat) - MoreDat2024-05-07T16:48:29Zhttp://moredat.ning.com/video/video/listTagged?tag=recursively&rss=yes&xn_auth=noLecture 9 | Programming Abstractions (Stanford)tag:moredat.ning.com,2012-10-27:6483656:Video:45352012-10-27T00:21:40.798ZJerome Trenthttp://moredat.ning.com/profile/2f1v1ewv1dry8
<a href="http://moredat.ning.com/video/lecture-9-programming-abstractions-stanford"><br />
<img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345140757?profile=original&width=240&height=180" width="240"></img><br />
</a> <br></br>Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br>
<br></br>
Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing…
<a href="http://moredat.ning.com/video/lecture-9-programming-abstractions-stanford"><br />
<img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140757?profile=original&width=240&height=180" width="240" height="180" alt="Thumbnail" /><br />
</a><br />Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br />
<br />
Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing different pictures. She then discusses the problem of moving a stack of disks from one peg to the other peg. Later, she demonstrates the basic principle necessary to solve the problem with a child's toy and goes through how to solve the problem with a program. Lecture 8 | Programming Abstractions (Stanford)tag:moredat.ning.com,2012-10-26:6483656:Video:47342012-10-26T23:56:29.420ZJerome Trenthttp://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&width=240&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&width=240&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.