Consider the following algorithm, which accepts a list A[1…n] with n items and performs a set of operations:

myfunc(A, n):
    i = 1
    while (i < n):
        ### Loop Invariant ###
        if (A[i] > A[i+1]):
            temp = A[i]
            A[i] = A[i+1]
            A[i+1] = temp
        i = i + 1  
    return A[n]

What is an appropriate loop invariant for this algorithm at the point specified?