一、排序总结
![在这里插入图片描述](https://img-blog.csdnimg.cn/20190307145947394.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3UwMTIwMTc3ODM=,size_16,color_FFFFFF,t_70)
(1) 快排
private void quicksort(int[] array, int begin, int end) {
// TODO Auto-generated method stub
if(begin<end)
{
int key=array[begin]; //设置第一个元素为基准元素
int i=begin;
int j=end;
while(i<j)
{
while(i<j&&array[j]>key)
{
j--;
}
if(i<j)
{
array[i]=array[j];
i++;
}
while(i<j&&array[i]<key)
{
i++;
}
if(i<j)
{
array[j]=array[i];
j--;
}
array[i]=key; //放置基准元素
quicksort(array,begin,i-1);
quicksort(array,i+1,end);
}
}
}
(2) 堆排序
public static void heapSort(int[] arr) {
if (arr == null || arr.length < 2) {
return;
}
for (int i = 0; i < arr.length; i++) {
heapInsert(arr, i);
}
int size = arr.length;
swap(arr, 0, --size);
while (size > 0) {
heapify(arr, 0, size);
swap(arr, 0, --size);
}
}
//建堆
public static void heapInsert(int[] arr, int index) {
while (arr[index] > arr[(index - 1) / 2]) {
swap(arr, index, (index - 1) / 2);
index = (index - 1) / 2;
}
}
//堆调整
public static void heapify(int[] arr, int index, int size) {
int left = index * 2 + 1;
while (left < size) {
int largest = left + 1 < size && arr[left + 1] > arr[left] ? left + 1 : left;
largest = arr[largest] > arr[index] ? largest : index;
if (largest == index) {
break;
}
swap(arr, largest, index);
index = largest;
left = index * 2 + 1;
}
}
//交换数据
public static void swap(int[] arr, int i, int j) {
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
(3) 归并排序
public static void mergeSort(int[] arr) {
if (arr == null || arr.length < 2) {
return;
}
mergeSort(arr, 0, arr.l