qq_24534199的博客

python快速排序： 方法一： def quick_sort(L, start, end): if start >= end: return low, high, pivot = start, end, L[start] while low < high: while (low < high) and (L[high...

Python: 方法一： # 归并排序 def merge(left, right): c = [] j = h = 0 while j < len(left) and h < len(right): if left[j] < right[h]: c.append(left[j]) j ...

public static int[] sort(int[] array){ for(int i=0;i<array.length-1;i++){ for(int j=0;j<array.length-1-i;j++){ if(array[j]>=array[j+1]){ ...