CS 61B Lecture 20: Algorithm Analysis

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

Category:

Education

Tags:

• CS
• 61b
• algorithm
• analysis
• shewchuk
• ucberkeley
• lecture
• yt:quality=high

[pacific14586]

He seems like he would teach algorithms at Hogwarts.

[MyOverflow]

When I first heard him say Omega, I thought he sad "Big OMG Notation".

[eeg10]

I should've taken 61b with shewchuck instead of hilfinger.

[pusikgames]

I find it boring and disaponting that he reads from a paper, he most likely know all that without it anyway. It gets more interesting when teacher talk "from their heart". Also, where's all the locic notations?!

[irchris420]

What is he talking about? 

[nestorga1]

@pacific14586 I took his class and I agree! Great professor though.

[comrade115]

nice vedio i like him too much his method of teaching

[dharshik]

i like to dance with the lecturer on halloween night!!

[fordboy111591]

if big ohn is reversed of big -oh then wat was the expression of the vice

[freetothinkify]

I found a baby one. The difference between the product and the sum, of any number times itself then ascending, plus the sum equals the product increasing differences of the number minus one. The exception is one, which decreases by -1,-1,-1, etc. I want to know why this is. Anyone know?