Study the algorithm on code review:
Counting Inversions
Previous study:
Count inversions - Extended merge sort - 3 Lecture Notes Study
Goal:
1. Time complexity: O(n*) -> O(nlogn)
2. Review the process of analysis by following lecture notes, the recurrence relationship using divide conquer - T(n) = 2*(T/2) + O(n), and then, using the combinatorics - do some analysis on the time complexity.
Master Theorem - Get back to the basics!
2. Review the process of analysis by following lecture notes, the recurrence relationship using divide conquer - T(n) = 2*(T/2) + O(n), and then, using the combinatorics - do some analysis on the time complexity.
Master Theorem - Get back to the basics!
No comments:
Post a Comment