@carl barbon if in worst case to print all inversion it takes O(n^2) why to use merge sort ot BIT , simply use insertion sort ..
On Wed, Oct 24, 2012 at 12:03 AM, Dipit Grover <[email protected]>wrote: > ^ Exactly! > > Dipit Grover > B.Tech in Computer Science and Engineering - lVth year > IIT Roorkee, India > > > > -- > 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. > -- *RAHUL KUMAR DUBEY* *BTech-3rd year * *Computer Science &Engineering * *Motilal Nehru National Institute Of Technology* *Allahabad[211004],UP.* -- 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.
