lst = [92, 88, 12, 76, 14, 79, 5, 72, 3]
# 선택 정렬
def selection(lst):
for i in range(0, len(lst)):
minIdx = i
for j in range(i, len(lst)):
if lst[minIdx] > lst[j]:
minIdx = j # 최소값 찾기
# swap
tmp = lst[i]
lst [i] = lst[minIdx]
lst[minIdx] = tmp
print(i+1, "회차")
print(lst)
selection(lst)
lst = [92, 88, 12, 76, 14, 79, 5, 72, 3]
# 선택 정렬
def selection(lst):
for i in range(len(lst)-1):
minIdx = i
for j in range(i-1, len(lst)):
if lst[minIdx] > lst[j]:
minIdx = j # 최소값 찾기
# swap
lst[i], lst[minIdx] = lst[minIdx], lst[i]
print(i+1, "회차")
print(lst)
selection(lst)
장점
단점
정렬 알고리즘 시간복잡도