in Algorithms
135 views
0 votes
0 votes
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem.                                          c) What is the same repeated equation in asymptotic notation using the recursion tree method.

FUNCTION(n)
if n>1
then
  print n
  FUNCTION(n/2)
  FUNCTION(n/4)
  FUNCTION(n/4)
  total = 0
  for i=1 ton
  do
  total = total + i*i
  print total
in Algorithms
by
135 views

Please log in or register to answer this question.

Related questions