ankur : i wont say its the best way, but it can be used
in one traversal the range can be determined and then count sort
can be applied.
On Mon, Oct 10, 2011 at 10:56 PM, Ankur Garg <[email protected]> wrote:
> @Sravan ..Counting Sort takes O(n) time but it needs range of nos to be
> known
> @Snehi jain..there is no range given so am not sure if count sort will work
> ,Can you please elaborate a bit on ur method
>
> Ankur
>
>
> On Mon, Oct 10, 2011 at 10:09 PM, sravanreddy001 <[email protected]
> > wrote:
>
>> Just went throught what a count sort is at
>> http://en.wikipedia.org/wiki/Counting_sort
>>
>> If all the elements are distinct which is possible, will this count sort
>> have any use?
>>
>> Also, the sorting takes O(nlogn) time right?
>>
>> Did I miss anything?
>>
>> --
>> 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/-/08bcRsmFYJgJ.
>>
>> 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.
