CS 61B Lecture 20: Algorithm Analysis



Uploaded by: ucberkeley
Video Description:
CS 61B: Data Structures - Fall 2006 Instructor Jonathan Shewchuk Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language. http://www.cs.berkeley.edu


Tags for this video: 61b algorithm analysis CS lecture shewchuk ucberkeley

Find more videos in the "Education" category
See more videos uploaded by ucberkeley

Related Videos
CS 61B Lecture 23: Trees and TraversalsCS 61B Lecture 8: Linked Lists IICS 61B Lecture 17: Encapsulation
cs-61b-lecture-23-trees-and-traversals.htmlcs-61b-lecture-23-trees-and-traversals.htmlcs-61b-lecture-23-trees-and-traversals.html
CS 61B Lecture 14: ExceptionsCS 61B Lecture 39: Augmenting Data StructuresCS 61B Lecture 13: Java Packages
cs-61b-lecture-23-trees-and-traversals.htmlcs-61b-lecture-23-trees-and-traversals.htmlcs-61b-lecture-23-trees-and-traversals.html


Share This Video:       StumbleUpon       del.icio.us       Reddit       digg       Furl       Spurl       Simpy       YahooMyWeb


Comments for this video: Show || Hide
Comments for this video on YouTube
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )



Tell a friend:


URL 
Embed Code