详见链接地址:https://www.cnblogs.com/Jason-Xiang/p/8567751.html
package org.sw.sort;
/**
* 排序示例
*
* @Description: TODO
* @author liangsw
* @date 2019-07-28
* @version 1.0v
*/
public class BasicSort {
static int[] arr = new int[] { 3, 2, 7, 5, 9, 4, 1, 6, 8, 0 };
public static void main(String[] args) {
// bubbleSort();
// selectionSort();
// insertionSort();
}
/**
* 冒泡排序算法
*
* @Description: TODO
* @author liangsw
* @date 2019-07-28
*/
public static void bubbleSort() {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i : arr) {
System.out.println(i);
}
}
/**
* 选择排序
*
* @Description: TODO
* @author liangsw
* @date 2019-07-28
*/
public static void selectionSort() {
for (int i = 0; i < arr.length - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
if (minIndex != i) {
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
for (int i : arr) {
System.out.println(i);
}
}
/**
* 插入排序
*
* @Description: TODO
* @author liangsw
* @date 2019-07-28
*/
public static void insertionSort() {
int temp;
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j > 0; j--) {
if (arr[j] < arr[j - 1]) {
temp = arr[j - 1];
arr[j - 1] = arr[j];
arr[j] = temp;
} else {
break;
}
}
}
for (int i : arr) {
System.out.println(i);
}
}
}