Simple insertion sort algo

insertion_sort.py

import operator as op


def insertion_sort(data, reverse=False):
    order = op.gt
    if reverse:
        order = op.lt

    for j in range(len(data)):
        key = data[j]
        i = j - 1

        while i >= 0 and order(data[i], key):
            data[i + 1] = data[i]
            i = i - 1

        data[i + 1] = key

    print('Sorted data (reverse={0}): {1}'.format(reverse, data))


if __name__ == '__main__':
    sample = [31, 41, 59, 26, 41, 58]
    insertion_sort(sample)
    insertion_sort(sample, reverse=True)