O(n log n) Algorithm for Counting Inversions II

Loading...
강의 계획서 보기

배우게 될 기술

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

검토

4.8(4,062개의 평가)
  • 5 stars
    83.75%
  • 4 stars
    13.58%
  • 3 stars
    1.62%
  • 2 stars
    0.36%
  • 1 star
    0.66%
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

VP

Apr 27, 2020

Professor Tim is an amazing instructor, and he explained all those elegant proofs in a brief and concise manner. I really enjoyed this course and certainly felt my IQ level going above roof ! :P

강사:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.