Omega(n log n) Lower Bound for Comparison-Based Sorting [Advanced - Optional]

Loading...
View Syllabus

Skills You'll Learn

Algorithms, Randomized Algorithm, Sorting Algorithm, Divide And Conquer Algorithms

Reviews

4.8 (3,226 ratings)
  • 5 stars
    2,731 ratings
  • 4 stars
    420 ratings
  • 3 stars
    47 ratings
  • 2 stars
    14 ratings
  • 1 star
    14 ratings
FR

Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

II

Sep 01, 2017

Amazing course. I learned a lot about algorithms, the implementation of algorithms, time complexity. I also learned a lot about being systematic and purposeful about including any line of code.

Taught By

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.