O(n). reference: http://en.wikipedia.org/wiki/Master_theorem . it's also described in CRLS <http://en.wikipedia.org/wiki/CLRS>
On Sun, Jan 16, 2011 at 7:36 PM, nphard nphard <[email protected]>wrote: > O(n) is correct. > > > On Sun, Jan 16, 2011 at 6:04 AM, snehal jain <[email protected]>wrote: > >> The running time of an algorithm is represented by the following >> recurrence relation: >> >> if n <= 3 then T(n) = n >> else T(n) = T(n/3) + cn >> >> Which one of the following represents the time complexity of the >> algorithm? >> >> acc to me O(n) is the answer? but on the site it was O(nlogn).. so plz >> correct me if i am wrong.. >> >> -- >> 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]<algogeeks%[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]<algogeeks%[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.
