归并排序,今天好像学的特别少(用python写的)
def merge_list(left_lst,right_lst):
left_index,right_index=0
res_lst=[]
while left_index<len(left_lst) and right_index<len(right_lst):
if left_lst[left_index]<right_lst[right_index]:
res_lst.append(left_lst[left_index])
left_index+=1
else:
res_lst.append(right_lst[right_index])
right_index+=1
if left_index==len(left_lst):
res_lst.extend(right_lst[right_index:])
else:
res_lst.extend(left_lst[left_index:])
return res_lst
def merge_sort(lst):
if len(lst)<=1:
return lst
middle=len(lst)/2
left_lst=merge_sort(lst[:middle])
right_lst=merge_sort(lst[middle:])
return merge_lst(left_lst,right_lst)