該程式僅在沒有時才有效。元素數為 2，如果超過 2，則無效。
#Selection Sort
L = []
n = int(input('Enter the number of elements\t:'))
for i in range(n):
item = int(input('Enter item\t:'))
L.append(item)
print('List\t:')
for i in range(n-1):
for j in range ((i 1),n-1):
if (L[j]<L[i]):
(L[j],L[i]) = (L[i],L[j])
print(L)
輸出 1 輸出 2
uj5u.com熱心網友回復：
L = []
n = int(input('Enter the number of elements\t:'))
for i in range(n):
item = int(input('Enter item\t:'))
L.append(item)
print('List\t:')
#First loop from 0 to n-1
for i in range(n-1):
#second loop from 1 to n
for j in range ((i 1),n):
if (L[j]<L[i]):
(L[j],L[i]) = (L[i],L[j])
print(L)
輸入
Enter item :5
List :
Enter item :2
List :
Enter item :3
List :
Enter item :1
輸出
[1, 2, 3, 5]
uj5u.com熱心網友回復：
試試這個
enter code here
#Declare variable for selection sort
L = []
n = int(input('Enter the number of elements\t:'))
#iterate for add values
for i in range(n):
item = int(input('Enter item\t:'))
L.append(item)
print('List\t:')
#iterate for select minimun value and swap value in the array
for i in range(len(L)):
# Find the minimum element in remaining
# unsorted array
min_idx = i
for j in range(i 1, len(L)):
if L[min_idx] > L[j]:
min_idx = j
# Swap the found minimum element with
# the first element
L[i], L[min_idx] = L[min_idx], L[i]
print(L)
uj5u.com熱心網友回復：
代碼：
#Selection Sort
L = []
n = int(input('Enter the number of elements\t:'))
for i in range(n):
item = int(input('Enter item\t:'))
L.append(item)
print('List\t:')
for i in range(n-1):
for j in range ((i 1),n):
if (L[j]<L[i]):
(L[j],L[i]) = (L[i],L[j])
print(L)
輸出：
這里
轉載請註明出處，本文鏈接：https://www.uj5u.com/qukuanlian/384818.html