def gnome_sort_linked(d):

    # start at 2nd node
    node = d._front._next_node

    while(node is not None):

        # if previous is less than node, step right
        if(node._value >= node._prev_node._value):
            node = node._next_node

        else:

            # swap problemrino
            x = _swap_a(node._prev_node)

            if(node == d._front):
                node = node._prev_node

            else:
                node = node._next_node

    return