if i'm not wrong .. we are to repeat this process till no more such pair is found.. rite?? this condition will come only if the given array gets sorted in ascending order .. so the solution is to sort the array O(nlogn)..
On Sat, Mar 24, 2012 at 7:31 PM, Navin Kumar <navin.nit...@gmail.com> wrote: > Given an array of integers, for each index i, you have to swap the value > at i with the first value smaller than A[ i ] that comes after index i. > An efficient solution expected. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/an6YzWV-2xsJ. > 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.
