@Lucifer (Regarding your latest approach) - I guess you meant string based comparison sort in the first step, as in 9 would be greater than 10. The special case seems correct but I doubt the complexity being nlog n, considering the special case.
-- 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. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
