yup possible but tradeoff in space complexity increases.
first use count sort principle
int a[10];
is the array with duplicate elements;
let b[n] contain no of times each element occurs.
let c[i]=b[a[i]] for all values of i;
decrease b[i] once every 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 group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
