Question: Q.8 Given the following program: 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):

 Q.8 Given the following program: Function riddle (n): p=0 for i

Q.8 Given the following program: 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 (line 7) return p the number of additions in (line 7) is thus n n (1) i=1 j=i+1 k=1 What is the exact formula? Evaluate. A.8 Q.9 What is the asymptotic order for the number of additions in the program given in Q.8 above? A.9

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!