[파이썬] [SWEA] 4843. [파이썬 S/W 문제해결 기본] 2일차 - 특별한 정렬

swexpertacademy.com/main/learn/course/subjectList.do?courseId=AVuPDN86AAXw5UW6

SW Expert Academy

1. normal

def BubbleSort(x_list):
    for i in range(len(x_list) - 1, 0, -1):
        for j in range(i):
            if x_list[j] > x_list[j + 1]:
                x_list[j], x_list[j + 1] = x_list[j + 1], x_list[j]
    return x_list

T = int(input())
# 여러개의 테스트 케이스가 주어지므로, 각각을 처리합니다.
for test_case in range(1, T + 1):
    N = int(input())
    list_a = list(map(int, input().split()))
    sort_a = BubbleSort(list_a)
    sort_list = [0]*N
    for k in range(1,N+1):
        if k % 2 == 1:
            sort_list[k-1] = sort_a.pop(-1)

        else:
            sort_list[k-1] = sort_a.pop(0)
    print('#{}'.format(test_case),end=' ')
    for a in range(10):
        print('{}'.format(sort_list[a]),end=' ')
    print()