常用排序算法实现
- 快排
- 冒泡排序
- 简单选择排序
- 堆排序
- 直接插入排序
- 归并排序
- 希尔排序
package sort.thrid;
public class Main {
public static void quickSort(int[] arr, int i, int j) {
if(arr == null || arr.length <= 1) {
return;
}
if(i < j) {
int mid = partitioner(arr, i, j);
quickSort(arr, i, mid);
quickSort(arr, mid + 1, j);
}
}
public static int partitioner(int[] arr, int i, int j) {
int p = arr[i];
while (i < j) {
while (i < j && p <= arr[j]) {
j--;
}
if(i < j) {
arr[i++] = arr[j];
}
while (i < j && p >= arr[i]) {
i++;
}
if(i < j) {
arr[j--] = arr[i];
}
}
arr[i] = p;
return i;
}
public static void bubbleSort(int[] arr) {
if(arr == null || arr.length <= 1) {
return;
}
boolean flag = false;
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if(arr[j] > arr[j + 1]) {
flag = true;
swap(arr, j, j + 1);
}
}
if(!flag) {
break;
}
}
}
public static void heapSort(int[] arr) {
if(arr == null || arr.length <= 1) {
return;
}
int n = arr.length;
for(int i = n / 2 - 1; i >= 0; i--) {
adjustHeap(arr, i, n - 1);
}
while (n-- > 0) {
swap(arr, 0, n);
adjustHeap(arr, 0, n - 1);
}
}
public static void adjustHeap(int[] arr, int i, int length) {
int temp = arr[i];
for(int k = 2 * i + 1; k < length; k = 2 * k + 1) {
if(k + 1 < length && arr[k] < arr[k + 1]) {
k++;
}
if(temp < arr[k]) {
arr[i] = arr[k];
i = k;
}
}
arr[i] = temp;
}
public static void insertSort(int[] arr) {
if(arr == null || arr.length <= 1) {
return;
}
int temp = 0, j = 0;
for (int i = 1; i < arr.length; i++) {
temp = arr[i];
for (j = i - 1; j >= 0; j--) {
if(temp < arr[j]) {
arr[j + 1] = arr[j];
} else {
break;
}
}
arr[j + 1] = temp;
}
}
public static void selectSort(int[] arr) {
if(arr == null || arr.length <= 1) {
return;
}
for (int i = 0; i < arr.length - 1; i++) {
int min = i;
for (int j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
if (min != i) {
swap(arr, min, i);
}
}
}
public static void mergeSort(int[] arr, int l, int r, int[] temp) {
if(arr == null || arr.length <= 1) {
return;
}
if(l < r) {
int mid = (l + r) / 2;
mergeSort(arr, l, mid, temp);
mergeSort(arr, mid + 1, r, temp);
merge(arr, l, mid, r, temp);
}
}
public static void merge(int[] arr, int l, int mid, int r, int[] temp) {
int p1 = l, p2 = mid + 1, k = l;
while (p1 <= mid && p2 <= r) {
if(arr[p1] < arr[p2]) {
temp[k++] = arr[p1++];
} else {
temp[k++] = arr[p2++];
}
}
while (p1 <= mid) {
temp[k++] = arr[p1++];
}
while (p2 <= r) {
temp[k++] = arr[p2++];
}
for(int i = l; i <= r; i++) {
arr[i] = temp[i];
}
}
public static void shellSort (int[] arr) {
if(arr == null || arr.length <= 1) {
return;
}
for(int gap = arr.length / 2; gap > 0; gap /= 2) {
for(int j = gap; j < arr.length; j++) {
int temp = arr[j], p = j - gap;
while (p >= 0 && arr[p] > temp) {
arr[p + gap] = arr[p];
p -= gap;
}
arr[p + gap] = temp;
}
}
}
public static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public static void print(int[] arr) {
for (int i = 0; i < arr.length; i++) {
if(i == arr.length - 1) {
System.out.println(arr[i]);
} else {
System.out.print(arr[i] + " ");
}
}
}
public static void main(String[] args) {
int[] arr = new int[]{1,3,4,6,12,3,5,1,6,2,7,9,1,3,5,4};
bubbleSort(arr);
quickSort(arr, 0, arr.length - 1);
heapSort(arr);
insertSort(arr);
selectSort(arr);
shellSort(arr);
int[] temp = new int[arr.length];
mergeSort(arr, 0, arr.length - 1, temp);
print(arr);
}
}