Lecture 8: Efficiency and Order of Growth thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Lecture 8: Efficiency and Order of Growth

Published on Oct 29, 20122446 Views

This lecture revolves around the topic of algorithmic efficiency. It introduces the random access model (RAM) of computation and "big O notation" as a way to talk about order of growth. It concludes w

Related categories