Below are five different functions for sorting a list of elements in increasing order. For simplicity, assume that the list only contain ints. For each, we are going to ask you about how the algorithm creates its output and about the complexity - or order of growth - of the algorithm.

def sort1(lst):
swapFlag = True
iteration = 0
while swapFlag:
swapFlag = False
for i in range(len(lst)-1):
if lst[i] lst[i+1]:
temp = lst[i+1]
lst[i+1] = lst[i]
lst[i] = te

Question

Below are five different functions for sorting a list of elements in increasing order. For simplicity, assume that the list only contain ints. For each, we are going to ask you about how the algorithm creates its output and about the complexity - or order of growth - of the algorithm.

    def sort1(lst):
        swapFlag = True
        iteration = 0
        while swapFlag:
            swapFlag = False
            for i in range(len(lst)-1):
                if lst[i] > lst[i+1]:
                    temp = lst[i+1]
                    lst[i+1] = lst[i]
                    lst[i] = te