Question: Give time complexity (Big-O) of this function: def function1(n): sum = 0 for i in range(n): for j in range(i): sum += 1 for k

Give time complexity (Big-O) of this function:

def function1(n): sum = 0 for i in range(n): for j in range(i): sum += 1 for k in range(6000): sum += 1 return sum

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!