@ATUL..still we are not comparing elements among themselvesThe ordering
of elements is already known to us
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Tue, Jan 24, 2012 at 10:19 AM, atul anand atul.87fri...@gmail.comwrote:
@Don : if i am not
Dutch flag is like a radix sort in that we know the range of values,
and the range is fixed and small compared to the size of the array.
All we don't know is how many of each of the three values occur in the
array. Dutch Flag is not a comparison based algorithm because you can
write it without
The Dutch Flag problem falls into the same category as radix sort,
which is not a comparison-based sorting algorithm.
Don
On Jan 23, 1:26 am, atul anand atul.87fri...@gmail.com wrote:
Hi all,
as we all know that any sorting algorithm based on comparison model has
lower bound of nlogn i.e
@Don : if i am not wrong ... American flag problem is closely related to
radix sort not dutch flag.
On Mon, Jan 23, 2012 at 11:16 PM, Don dondod...@gmail.com wrote:
The Dutch Flag problem falls into the same category as radix sort,
which is not a comparison-based sorting algorithm.
Don
On
