CS 3343 Analysis of Algorithms Exam 2 Review

• Growth rates of functions
  • big-oh, big-omega, big-theta
  • Stirling's approcimation
  • lg*
  • simple proofs
• Determining the order of a program segment
• Sorting algorithms: For each of the following sorting algorithms you should know:
  • the algorithm used
  • the order of the algorithm for best, worst and average case
  • how to apply the algorithm to a particular example
    • bubble sort
    • insertion sort
    • selection sort
    • Quicksort
    • heap sort
    • bin sort
    • radix sort
• Decision trees
• Simple recurrence relations

• Back to CS 3343 Homepage