• 2064 views

    Lec 22 - Programming Abstractions (Stanford)

    "Lec 22 - Programming Abstractions (Stanford)" Lecture 22 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie discusses map as a vector and describes a different, possibly better, strategy. The basics of trees and their usefulness and how they can be used with binary search is then introduced. 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
    2110 views

    Lec 23 - Programming Abstractions (Stanford)

     45:51
    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