d cause of a b c have complexity o(nlogn)
--
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.
Radix Sort
On Mon, Nov 14, 2011 at 1:57 PM, Vijay Khandar wrote:
> Which is the sorting algm sorts the integers [1...n^3] in
> O(n).
> a)Heapsort
> b)Quicksort
> c)Mergesort
> d)Radix sort
>
> please tell anyone.
> Vijay.
>
> --
> You received this message becaus
Radix sort
On Mon, Nov 14, 2011 at 1:57 PM, Vijay Khandar wrote:
> Which is the sorting algm sorts the integers [1...n^3] in
> O(n).
> a)Heapsort
> b)Quicksort
> c)Mergesort
> d)Radix sort
>
> please tell anyone.
> Vijay.
>
> --
> You received this message becaus
Has to be (d) Radix sort (using counting sort, which will sort
the individual digits in O(n) time).
--
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 grou
Bit confused by your n^3.
Could you clarify?
In the mean time Radix is an O(n) sorting algorithm. Where n is the
length of the array.
On 14/11/2011, Vijay Khandar wrote:
> Which is the sorting algm sorts the integers [1...n^3] in
> O(n).
> a)Heapsort
> b)Quicksort
> c)Mergesort
> d)Ra
Which is the sorting algm sorts the integers [1...n^3] in
O(n).
a)Heapsort
b)Quicksort
c)Mergesort
d)Radix sort
please tell anyone.
Vijay.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this grou
