Analyze the following code and determine its approximate running time and worst-case time complexity. Assume input size is n. Show all step counts. Give Big-Oh of the time complexity T(n) and prove it.

def sort(A):

"""Sort list into nondecreasing order."""

for k in range(1, len(A)):

cur = A[k]

j = k

while j > 0 and A[j-1] > cur:

A[j] = A[j-1]

j -= 1

A[j] = cur