Counting the Number of Inversions By Divide and Conquer
Vložit
- čas přidán 30. 09. 2013
- 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. - Věda a technologie
possibly the clearest explanation that anyone could ever provide !! Thanks, Prof Dan Gusfield !!
That was an awesome explanation, hats off to the teacher!
outstanding explanation, and thank you professor.
Amazing lecture. Thank you!
professors is cheerful and awesome.
awesome video cleared a lot of confusion
Class notes :
web.cs.ucdavis.edu/~gusfield/cs122f10/inversioncount.pdf
Nice explanation
How could they manage to hold their laugh when he said BJ.....
I thought he was going to laugh.