Using Hashing
space : O(n)
time : O(n)
Using sorting
space : O(1)
time : O(nlogn)
special case: (all elements are of the range of the array then using count
sort)
space : O(1)
time : O(n)
any better solutions???
--
Regards
Jitendra Kushwaha
MNNIT, Allahabad
--
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.
