• 2164 views

    Lec 8 - Programming Abstractions (Stanford)

    "Lec 8 - Programming Abstractions (Stanford)" Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist for the Course: http://www.youtube.com/view_play_list?p=FE6E58F856038C69 CS 106B Course Website: http://cs106b.stanford.edu Stanford Center for Professional Development: http://scpd.stanford.edu/ Stanford University: http://www.stanford.edu/ Stanford University Channel on YouTube: http://www.youtube.com/stanforduniversity/

    Video is embedded from external source so embedding is not available.

    Video is embedded from external source so download is not available.

    Here is the next lecture for this course

    Watch NEXT
    LECTURE
    2103 views     Lec 7 - Programming Abstractions (Stanford)

    Lec 9 - Programming Abstractions (Stanford)

     48:04
    Lecture List | Course Details | Contents | Related

    No content is added to this lecture.

    Go to course:

    This video is a part of a lecture series from of stanford