O(n log n) Algorithm for Counting Inversions I

Loading...
Просмотреть программу курса

Получаемые навыки

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

Рецензии

4.8 (оценок: 3,516)
  • 5 stars
    2,971 ratings
  • 4 stars
    458 ratings
  • 3 stars
    54 ratings
  • 2 stars
    14 ratings
  • 1 star
    19 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.

SN

Mar 26, 2020

I'm happy with this course because is a little challenging, not like other coursers where there are trivial answers and tests. I feel now much more confident with my fundamentals. Thank you Tim!

Преподаватели

  • Tim Roughgarden

    Tim Roughgarden

    Professor

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.