@ligerdave.. actually.. the problem is, O(n) is correct, but, this will again space dependent where it is again O(n).. so.. it has to be done in constant space.. no additional space.. so.. just swapping is allowed.. what's the best time complexity for this?
-- 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.
