iwgmsft!!! We can divide them into O(2logn) subproblems but it doesn't mean that dividing them in these subproblems will take O(2logn) time. If we process all n^2 elements it can never take less than O(n^2) time.
Arunachalam! Your solution is correct (upto where i have looked into it).Good work... Now, can you make it O(n). This is a teaser :) best of luck --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
