@saurabh: are u referring to bit map sort?
On Mon, Aug 8, 2011 at 5:51 PM, saurabh singh wrote:
> If you limit the magnitude of numbers,it is
>
>
> On Mon, Aug 8, 2011 at 9:02 PM, siva viknesh wrote:
>
>> is there any possible solution for O(1) space and O(n) time for
>> unsorted array?
>>
>
If you limit the magnitude of numbers,it is
On Mon, Aug 8, 2011 at 9:02 PM, siva viknesh 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 wrote:
> > @raghvan: take care of space complexityyou are using extra s
is there any possible solution for O(1) space and O(n) time for
unsorted array?
On Aug 7, 11:45 am, Amol Sharma wrote:
> @raghvan: take care of space complexityyou 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 a
