We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I have been banging my head around this, can someone tell me, why my solution is failing 3 testcases
python
def runningTime(arr):
count = 0
for i in range(1, len(arr)):
curnum = arr[i]
for j in range(i-1, -1,-1):
if arr[j] > curnum:
arr[j+1] = arr[j]
count = count + 1
else:
arr[j+1] = curnum
break
return count
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Running Time of Algorithms
You are viewing a single comment's thread. Return to all comments →
I have been banging my head around this, can someone tell me, why my solution is failing 3 testcases
python def runningTime(arr): count = 0 for i in range(1, len(arr)): curnum = arr[i] for j in range(i-1, -1,-1): if arr[j] > curnum: arr[j+1] = arr[j] count = count + 1 else: arr[j+1] = curnum break return count