使用一些隨機數(shù)的合并排序不起作用。當我調(diào)用對隨機數(shù)進行排序時，我在終端上獲得輸出。有什么想法嗎？Nonemerge_sort()輸出：隨機數(shù)？： 20 合并排序： [7， 7， 10， 19， 10， 1， 3， 6， 15， 10， 15， 5， 0， 1， 6， 9， 15， 1， 5， 6] 無def merge_sort(sequence): if len(sequence) > 1: half_sequence = len(sequence) // 2 first_half = sequence[:half_sequence] second_half = sequence[half_sequence:] merge_sort(first_half) merge_sort(second_half) i = 0 j = 0 k = 0 while i < len(first_half) and j < len(second_half): if first_half[i] < second_half[j]: sequence[k] = first_half[i] i += 1 #print (i) else: sequence[k] = second_half[j] j += 1 k += 1 #print (i) while i < len(first_half): sequence[k] = first_half[i] i += 1 k += 1 while j < len(second_half): sequence[k] = second_half[j] j += 1 k += 1def random_list(n): lista = [0] * n for i in range(n): lista[i] = random.randint(0,n) return listaprint("Random Numbers?:")n=int(input())random_num = random_list(n)print ("Merge Sort: {}".format(random_num))print(merge_sort(random_num))′′′
2 回答
一只甜甜圈
TA貢獻1836條經(jīng)驗 獲得超5個贊
import random
def merge_sort(sequence):
if len(sequence) > 1:
half_sequence = len(sequence) // 2
first_half = sequence[:half_sequence]
second_half = sequence[half_sequence:]
merge_sort(first_half)
merge_sort(second_half)
i = 0
j = 0
k = 0
while i < len(first_half) and j < len(second_half):
if first_half[i] < second_half[j]:
sequence[k] = first_half[i]
i += 1
#print (i)
else:
sequence[k] = second_half[j]
j += 1
k += 1
#print (i)
while i < len(first_half):
sequence[k] = first_half[i]
i += 1
k += 1
while j < len(second_half):
sequence[k] = second_half[j]
j += 1
k += 1
return sequence
def random_list(n):
lista = [0] * n
for i in range(n):
lista[i] = random.randint(0,n)
return lista
print("Random Numbers?:")
n=int(input())
random_num = random_list(n)
print ("Merge Sort: {}".format(random_num))
print(merge_sort(random_num))′′′
合并排序函數(shù)沒有 return 語句。請返回 。sequence
添加回答
舉報
0/150
提交
取消