@saurabh: are u referring to bit map sort? On Mon, Aug 8, 2011 at 5:51 PM, saurabh singh <[email protected]> wrote:
> If you limit the magnitude of numbers,it is.... > > > On Mon, Aug 8, 2011 at 9:02 PM, siva viknesh <[email protected]>wrote: > >> is there any possible solution for O(1) space and O(n) time for >> unsorted array? >> >> On Aug 7, 11:45 am, Amol Sharma <[email protected]> wrote: >> > @raghvan: take care of space complexity....you are using extra space >> that >> > too O(n) in worst case... >> > >> > can be done in O(nlogn) >> > >> > else it can be done in O(n) if the given array is sorted in two >> traversals >> > !! >> > -- >> > >> > Amol Sharma >> > Third Year Student >> > Computer Science and Engineering >> > MNNIT Allahabad >> > >> > On Sun, Aug 7, 2011 at 11:35 AM, programming love < >> > >> > >> > >> > >> > >> > >> > >> > [email protected]> wrote: >> > > So is q 1 a C++ question?? >> > >> > > On Sun, Aug 7, 2011 at 11:27 AM, hary rathor <[email protected] >> >wrote: >> > >> > >> no c doesn't >> > >> > >> -- >> > >> 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. >> >> -- >> 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. >> >> > > > -- > Saurabh Singh > B.Tech (Computer Science) > MNNIT ALLAHABAD > > > -- > 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. > -- "People often say that motivation doesn't last. Well, neither does bathing - that's why we recommend it daily." -- 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.
