3 1 On log n Algorithm for Counting Inversions I 13 min

Sdílet
Vložit
  • čas přidán 26. 01. 2017

Komentáře • 15

  • @tigernov_425
    @tigernov_425 Před 4 lety +10

    believe it or not, this is a very good lecture. The way he plays out the idea is coarse but well-structured. Make sure you come back when you have some basic ideas of programming. This guy is genius, at least a truly fast thinker, in my opinion

    • @zakozakaria
      @zakozakaria Před 3 lety

      you should check the books, they are more detailed and helpful.

    • @vincent3542
      @vincent3542 Před 3 lety

      @@zakozakaria where I can find it?

    • @user-of6nq9yc4g
      @user-of6nq9yc4g Před 3 lety

      @@vincent3542 Algorithms Illuminated part 1

  • @leoniduvarov6565
    @leoniduvarov6565 Před 6 lety +4

    This video was very helpful. Thanks for the hard work in putting this series together!

  • @amoghmulge
    @amoghmulge Před 3 lety +12

    I understood everything except the algorithm

  • @chloekimball536
    @chloekimball536 Před 5 lety +6

    Nice video. All my instructor does is mumble and its difficult to catch what she is saying even while sitting in the front row.

  • @adhishmalviya2408
    @adhishmalviya2408 Před 4 lety +2

    whoever wrote subtitles for this video, doesn't know what indices are

  • @abhispace4
    @abhispace4 Před 6 lety +1

    what is a split inversion?

  • @nkemer
    @nkemer Před 3 lety +2

    It is very hard to understand if you weren't a native English speaker. Monotonic speaking makes it worse. I would've paid coursera if the videos were different. Luckily I have the books.

  • @meikandanathan2923
    @meikandanathan2923 Před 4 lety

    Not a detailed one.
    Need some technical implementations

  • @FredoCorleone
    @FredoCorleone Před 5 lety +4

    You don't even explain those different kind of inversion. Bad lesson