(arr)
return arr
Reference : https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
    Complexity : O(n^2)
Reference : https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
    Complexity : O(n^2)
Reference : https : // en . wikipedia . org / wiki / Sorting_algorithm#Exchange_sort Complexity : O ( n^2 )
def exchange_sort(arr):
    """
    Reference : https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
    Complexity : O(n^2)
    """
    arr_len = len(arr)
    for i in range(arr_len-1):
        for j in range(i+1, arr_len):
            if(arr[i] > arr[j]):
                arr[i], arr[j] = arr[j], arr[i]
    return arr
def exchange_sort ( arr ) : arr_len = len ( arr ) for i in range ( arr_len - 1 ) : for j in range ( i + 1 , arr_len ) : if ( arr [ i ] > arr [ j ] ) : arr [ i ] , arr [ j ] = arr [ j ] , arr [ i ] return arr