b.[CO7] Calculate the time complexity of the following recurrence relation. [Any method is
acceptable as long as steps are shown] T ( n ) = T ( n /3 ) + T ( n /5 ) + n.
Personalisation of Education by AI and Big Data - Lourdes Guàrdia
b--CO7- Calculate the time complexity of the following recurrence rela.pdf
1. b.[CO7] Calculate the time complexity of the following recurrence relation. [Any method is
acceptable as long as steps are shown] T ( n ) = T ( n /3 ) + T ( n /5 ) + n