By the end of this module, you should:

  • be able to apply limit tests to compare the asymptotic growth of two functions

  • be able to distinguish the fastest/slowest among several algorithms given their asymptotic complexities

  • describe the functionality of a collection abstract data type

  • describe the operation of some basic data structures that can implement a collection ADT