MoreDat

A Student Network for Collaboration and Sharing

Signup on MoreDat.com

What’s Next For Electronic Devices. Have you heard of FPGAs? Find out now here. And as a bonus get your free guide to writing a successful resume. Just Signup now and it’s all yours free.

Lecture 14 | Programming Abstractions (Stanford)

Watch it on MoreDat.Com

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.

0 members like this

Tags: algorithm, algorithms, analysis, big-O, how, More…