排序算法汇总
1. 插入排序
思路:假定第一个元素组成的序列是有序的,后面的元素不断往这个有序的序列中插入
public static void insertSort(int[] arr){
for(int i = 1;i<arr.length;i++){
int index = i -1;
int current = arr[i];
while(index >=0 && current < arr[index]){
arr[index + 1] = arr[index];
index--;
}
arr[index + 1] = current;
}
}
2. 选择排序
思路:每次找到最大的数字放到末尾,再从剩下的序列中找第二大的放在末尾
public static void choiceSort(int[] arr){
for(int i = 0;i<arr.length;i++){
for(int j = i+1;j<arr.length;j++){
if(arr[i] > arr[j]){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
3. 冒泡排序
思路:大的数字能一直交换到最后
public static void bubbleSort(int[] arr){
for(int i = 0;i<arr.length;i++){
for(int j = 0;j<arr.length-i-1;j++){
if(arr[j] > arr[j+1]){
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
}
4. 希尔排序
思路:分组的,每一次gap减小的插入排序
public static void shellSort(int[] arr,int gap){
for(int k = gap/2;k>0;k = k / 2){
for(int i = k;i<arr.length;i++){
for (int j = i;j>=k;j-=k){
if(arr[j] < arr[j-k]){
int temp = arr[j];
arr[j] = arr[j-k];
arr[j-k] = temp;
}
}
}
}
}
5. 归并排序
思路:先分后并的排序
public static void mergeSort(int[] arr,int[] temp,int low,int high){
if(low < high){//先分后合并
int middle = (low + high) / 2;
mergeSort(arr,temp,low,middle);
mergeSort(arr,temp,middle+1,high);
merge(arr,temp,low,middle,high);
}
}
public static void merge(int[] arr,int[] temp,int low,int middle,int high){
int index = 0;
int left = low;
int right = middle+1;
while(left <= middle && right <= high){
if(arr[left] < arr[right]) temp[index++] = arr[left++];
else if(arr[left] >= arr[right]) temp[index++] = arr[right++];
}
while(left <= middle) temp[index++] = arr[left++];
while (right <= high) temp[index++] = arr[right++];
for(int x = 0;x< index;x++){
arr[low + x] = temp[x];
}
}
6. 快速排序
思路:定义标杆的排序(据说效果最好)
public static void quickSort(int[] arr,int left ,int right){
if(left > right) return;
int base = arr[left];
int i = left;
int j = right;
while(i < j){
while(i<j && arr[j] >= base) j--;
while(i<j && arr[i] <= base) i++;
if(i < j){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
arr[left] = arr[i];
arr[i] = base;
quickSort(arr,left,i-1);
quickSort(arr,i+1,right);
}
注意顺序很关键