O(n log n) Algorithm for Counting Inversions II

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

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

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

Рецензии

4.8 (оценок: 3,986)
  • 5 stars
    84%
  • 4 stars
    14%
  • 3 stars
    2%
  • 2 stars
    0%
  • 1 star
    1%
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

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.

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

  • Tim Roughgarden

    Tim Roughgarden

    Professor

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

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