[prev] 93 [next]

Summary

  • Big-Oh notation
  • Asymptotic analysis of algorithms
  • Examples of algorithms with logarithmic, linear, polynomial, exponential complexity
  • Linked lists vs. arrays

  • Suggested reading:
    • Sedgewick, Ch. 2.1-2.4, 2.6