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
@prankmakers95 Honestly. no music is best.
jaberwocky6669 9 months ago
superb hair style !!! yeah!
josyula547 1 year ago
tell me peaple what is the name of the best music to learn with like homework i cant find enything
prankmakers95 1 year ago
You can find the latest version (fall 2008) on berkerley webcast... but this guy is cool so Im keeping this one
Polyron 2 years ago
To make it work for all Java integers you could String.split() the args[0] into a array and then iterate through the array. You'd need to put a space between each operand if you do this though like "3 5 +".
RunaWorld 2 years ago
Best-dressed lecturer I've ever seen!
cmslewis 2 years ago 2
Thanks. Very good lesson.
flagtube 3 years ago