@pranav : i will check for other test cases , if it work fine for all..then its cool one :) :)
On Wed, Feb 15, 2012 at 12:41 PM, atul anand <[email protected]>wrote: > @amit : it is valid for comparison based model...... > > > On Wed, Feb 15, 2012 at 12:05 PM, amrit harry <[email protected]>wrote: > >> @tushar >> lower bound for sorting an array is nlogn. >> >> http://www.bowdoin.edu/~ltoma/teaching/cs231/fall11/Lectures/6-moresorting/sortLB.pdf >> >> >> On Wed, Feb 15, 2012 at 11:16 AM, TUSHAR <[email protected]>wrote: >> >>> That means,,,we have to sort the array first in O(n). >>> Is there any way to sort the array inplace in O(n) ? >>> >>> -- >>> 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. >>> >>> >> >> >> -- >> AMRIT >> >> >> -- >> 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. >> > > -- 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.
