gokaymeydan/sorting-algorithm-visualizer

1from algorithms import insertion_sort2 3my_list = [5, 2, 4, 6, 1, 3]4steps = insertion_sort(my_list)5prev = None6 7 8def print_step(step, prev_step=None):9    for i, num in enumerate(step):10        bar = "█" * num11        if prev_step and prev_step[i] != num:12            print(f"{num:>2} {bar} <- shifted")13        else:14            print(f"{num:>2} {bar}")15    print("-" * 20)16 17 18for i, step in enumerate(steps):19    print(f"Step {i + 1}: {step}")20    print_step(step, prev)21    prev = step22