Python Insertion Sort

gistfile1.py

def insertion_sort(arr):
    for idx, number in enumerate(arr):
        current = idx
        previous = idx - 1
        if idx > 0:
            while arr[current] < arr[previous] and (previous >= 0):
                temp = arr[current]
                arr[current] = arr[previous]
                arr[previous] = temp
                current = previous
                previous -= 1
    return arr