Practical efficiency? If you want to print out n^2 things then you can't do it in less than n^2. If you can come up with an encoding that represents more than one inversion then great. However, that doesn't change the fact that you can't individually print out n^2 things in under n^2 time.
Look up trivial lower bounds, that's essentially what we're talking about. On 15 November 2012 06:42, Rahul Kumar Dubey <rkd7...@gmail.com> wrote: > @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 <dipitgro...@gmail.com>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 algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
