Counting the Number of Inversions By Divide and Conquer

A divide and conquer algorithm to count the number
of inversions in a list, and the worst-case time
analysis of O(n log n). The analysis is achieved
by setting up and solving a recurrence relation.

[@subramaniananantharaman1548]

possibly the clearest explanation that anyone could ever provide !! Thanks, Prof Dan Gusfield !!

[@nagarjunprasad]

That was an awesome explanation, hats off to the teacher!

[@zunayeedkamal8065]

outstanding explanation, and thank you professor.

[@varunhegde4658]

professors is cheerful and awesome.

[@OmarNg7X]

Amazing lecture. Thank you!

[@krishnasiddharthanemalikan9733]

awesome video cleared a lot of confusion

[@dimonyin429]

Nice explanation

[@aroonalok]

Class notes : web.cs.ucdavis.edu/~gusfield/cs122f10/inversioncount.pdf

[@nihaomrzhang5286]

How could they manage to hold their laugh when he said BJ.....

[@Adam-TheThorn]

I thought he was going to laugh.