hi all, try this....if u can help me Q. given a sequence of n distinct numbers a1,a2,.....,an , a pair (ai,aj) is known as significant inversion if i<j and ai>2aj. give O(n lg n) algorithm to count the number of significant inversions in the given sequence
thank you for ur time... sorry for reposting --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
