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

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.8(3,139 個評分)
  • 5 stars
    2,655 ratings
  • 4 stars
    409 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

NE

Nov 07, 2016

Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.

教學方

  • Tim Roughgarden

    Tim Roughgarden

    Professor

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。