Question: Function riddle (n): p=0 for i in range(n): i+=1 for j in range (n, i-1): for k in range (1, i+1): p + =1 return
Function riddle (n): p=0 for i in range(n): i+=1 for j in range (n, i-1): for k in range (1, i+1): p + =1 return p [14:35] What is the asymptotic order for the number of additions [14:35] What is the asymptotic order for the number of additions in the program given in Q.8 above?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
