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 bigO notation in the worst case?
def slowsolutionn: result
for i in xrangen:
for j in xrangei :
result
return result
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
