Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Por: Coursera . en: , ,

  • Week 1
    • Introduction; "big-oh" notation and asymptotic analysis.
  • Week 2
    • Divide-and-conquer basics; the master method for analyzing divide and conquer algorithms.
  • Week 3
    • The QuickSort algorithm and its analysis; probability review.
  • Week 4

    • Linear-time selection; graphs, cuts, and the contraction algorithm.

Plataforma