快速排序
public class QuickSort {
public static void main(String[] args) {
Random random = new Random();
int[] arr= new int[20];
for(int i=0;i=right) return;
int l = left,r=right;
int temp= arr[left];
while(l=temp) r--;
while(l
归并排序
public class MergeSort {
public static void main(String[] args) {
Random random = new Random();
int[] arr= new int[20];
for(int i=0;i= right) return;
int mid = (left + right) / 2;
mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);
merge(arr,left,mid,right);
}
public static void merge(int[] arr, int left, int mid, int right) {
int[] tmp = new int[right-left+1];
int index = 0;
int i=left,j=mid+1;
while(i<=mid && j<=right){
if(arr[i]<=arr[j]){
tmp[index++] = arr[i++];
}else{
tmp[index++] = arr[j++];
}
}
while(i<=mid){
tmp[index++] = arr[i++];
}
while(j<=right){
tmp[index++] = arr[j++];
}
for(int k=0;k 
