Counting Inversions

by Ping Jin — on algorithm, leetcode, merge sort, binary index tree 16 Nov 2014

Merge-Sort Count $O(N log N)$

Binary Indexed Tree $O(N log N)$

Author

Ping Jin

pjin1@ualberta.ca

Awesome Dude, Awesome Life

Comments