Lecture Details :
Counting execution steps, big oh, complexity classes, a priori estimation. Exponential growth, big numbers, estimation, huge ants. Emergence.
Lecture 5 of comp 1927 data structures and algorithms.
Course Description :
These are the 2009 lectures of COMP1927 Algorithms and Data Structures, which is the second computing course taken by first year computing students at UNSW.
Other Resources :
Other Data Structures Courses
» check out the complete list of Data Structures lectures