Fill in the code to complete the following function for sorting a list

Loading

Practice Recursion Questions – Fill in the code to complete the following function for sorting a list.
def sort(lst):
    _________________________ # Sort the entire list
def sortHelper(lst, low, high):
    if low < high:
        # Find the smallest number and its index in lst[low .. high]
        indexOfMin = low
        min = lst[low]
        for i in range(low + 1, high + 1):
            if lst[i] < min:
                min = lst[i]
                indexOfMin = i
        # Swap the smallest in list(low .. high) with list(low)
        lst[indexOfMin] = lst[low]
        lst[low] = min
        # Sort the remaining list(low+1 .. high)
        sortHelper(lst, low + 1, high)