Question: What is the runtime complexity using big - O notation in the worst case? def slow _ solution ( n ) : result = 0

What is the runtime complexity using big-O notation in the worst case?
def slow_solution(n): result =0
for i in xrange(n):
for j in xrange(i +1):
result +=1
return result

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!