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.
hi,
for i in range(n-2):
//this for loop goes til n-2 so big Oh for this statement is O(n) // upperbound
BUT
you are also calling
print(*arr, sep=' ') for every 'for' loop which is O(n)
so its O(n2) in total
Hope that helps
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Insertion Sort - Part 1
You are viewing a single comment's thread. Return to all comments →
hi, for i in range(n-2): //this for loop goes til n-2 so big Oh for this statement is O(n) // upperbound BUT you are also calling print(*arr, sep=' ') for every 'for' loop which is O(n) so its O(n2) in total Hope that helps