In this lesson, you'll learn about sets and Big O Notation. Specifically, the instructor goes over how to count all the scheme programs using diagonalization, and how there are things that you want to compute that there are no programs for. The instructor also introduces the concept of measuring how fast functions are growing, which is fundamental in algorithms, and demonstrates an example of calculating how many steps a sorting program takes.
Learn all about sets and Big O Notation.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/