O(n log n) Algorithm for Counting Inversions II

Loading...
강의 계획서 보기

배우게 될 기술

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

검토

4.8(2,975개의 평가)
  • 5 stars
    2,514 ratings
  • 4 stars
    392 ratings
  • 3 stars
    45 ratings
  • 2 stars
    11 ratings
  • 1 star
    13 ratings
CV

Jun 11, 2017

A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.

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.

강사:

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Coursera 카탈로그 살펴보기

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