Is it possible to perform counting sort on n elements without creating the extra array of size n,which is usually done in counting sort?where each element is [0,k-1].it can be done by swapping but the stable property of sorting is gone? so can we do it preserving the stability?????
-- 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.
