Best case : O(n) Worst case : O(n^2) can be done using stack. Thinking of better solution. .
On Wed, Jul 27, 2011 at 11:50 AM, ankit sambyal <[email protected]>wrote: > O(n^2) algo is trivial. Can anybody think of a better approach ??? > > -- > 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. > -- 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.
