Lecture 14 | Programming Abstractions (Stanford)

Lecture 14 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and their uses.

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/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• 14
• algorithms
• analysis
• big-o
• sorting
• recurrences

[frW87]

This video has helped me a lot. The teacher is great! Thank you for this

[scoarescoare]

After watching a couple of Julie's videos, I kind of feel like I should have taken more theoretical courses. These videos have been put together very well. Thanks a ton.

[BallawdeQuincewold]

Watch with subtitles at 40:30

[agapitoflores001]

I think I'm gonna be a perfect IT by watching this video. Wow. LOL

[ludasnow1]

Wow i needed this....

[kalpsen]

@Rakesh16791 You are weak in advanced math, go and take Math, and come back, u will understand better.

[kalpsen]

The way Julie acts out "The class list says 220, which it does, WHERE ARE THEY ?"

is really cute.

[Rakesh16791]

Bhudia kya boli kuch samaj main nahi aaya......

[hexam1ner]

the way she explains things is just superb. big-o and quantitative analysis is quite hard to grasp initially. but she makes it so simple.

kudos to her for her knowledge and teaching style.