Dear all, I'm a bit stuck on my algorithm exercise, the problem asks us to construct an algorithm that finds the median of an array in theta(n^lg3) time. According the the Master Theorem the recurrence relation of this algorithm should look like the following:
T(n) = / theta(1) n =1 \ 3T(n/2) + theta(n) I have spent hours trying to derive an algorithm out of the above relation, but still stuck, any hint would be appreciated!! Thanks --~--~---------~--~----~------------~-------~--~----~ 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-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
