266 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

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
usdid asked Jul 2, 2022
476 views
what is the running time of the following iterative algorithm?b) It is possible to talk about the best, average and worst running times for this algorithm. Why? pseudo co...