klmyty的博客

def merge(arr,l,m,r,temp): k = l i = l j = m+1 while i<m+1 and j<r+1: if arr[i]<arr[j]: temp[k]=arr[i] i+=1 else: temp[k]=arr[j] j+=1 k+=1 #将左右两边剩余的数字直接加入到

#!/usr/bin/python3def quickSort(arr,low,high): i=low j=high temp=arr[low] while i<j: #从后往前搜索找到小于temp的值所在位置 while arr[j] > temp and j > i: j -= 1 if j > i: arr[i] = arr[j]

#include <iostream>#include<fstream>#include<stdio.h>using namespace std;template<class Type>class Loading{ //friend Type MaxLoading(Type[],Type,int);//private:pu...