1256B - Minimize the Permutation - CodeForces Solution

K = int(input())

def move(i1,i2):
    global a
    i = i2
    while i > i1:
        a[i],a[i - 1] = a[i - 1],a[i]
        i -= 1

    if i > 0 and a[i] < a[i - 1] :
        a[i],a[i - 1] = a[i - 1],a[i]


while K:
    k = int(input())
    a = list(map(int, input().split(' ')))
    Mi = 1
    i = 0
    left = 0
    while i < k:
                if a[i] == Mi:
                        move(left, i)
                        left = i + 1
                                    try:
                Mi = min(a[i + 1:])
            except:
                pass


        i += 1

    for i in range(k):
        print(a[i],end=' ')
    print()

    K -= 1