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
Get step-by-step solutions from verified subject matter experts
