Discussed many times, 1) add some lines to merge sort 2) use Binary indexed tree for a faster version (i have not tried but get to know it can be done using binary indexed tree)
On Thu, Jun 9, 2011 at 4:05 PM, D.N.Vishwakarma@IITR <[email protected]>wrote: > Inversion means pair(i,j) such that i<j and A[i]>A[j] > > -- > **With Regards > Deoki Nandan Vishwakarma > IITR MCA > * > * > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
