一、整体状况
二、源码及其思路
1、冒泡排序
import java.util.Arrays;
public class BubbleSort {
public static void main(String[] args) {
int[] arr = new int[]{4,4,2,3,1};
bubbleSort(arr);
System.out.println(Arrays.toString(arr));
}
private static void bubbleSort(int[] arr) {
for (int i = arr.length-1;i>=0;i--){
for (int j = 0; j<i; j++){
if (arr[j]>arr[j+1]){
int tem = arr[j];
arr[j] = arr[j+1];
arr[j+1] = tem;
}
}
}
}
}
2、直接插入排序
import java.util.Arrays;
public class InsertSort {
public static void main(String[] args) {
int[] arr = new int[]{2,5,8,3};
insertSort(arr);
System.out.println(Arrays.toString(arr));
}
private static void insertSort(int[] arr) {
for (int i = 0;i<=arr.length-1;i++){
int a = arr[i];
int j = i - 1;
while (j>=0 && arr[j]>a){
arr[j+1] = arr[j];
--j;
}
arr[j+1] = a;
}
}
}
3、归并排序
import java.util.Arrays;
public class MergeSort {
public static void main(String[] args) {
int[] nums = new int[]{6,5,4,3,2,1};
sortArray(nums);
System.out.println(Arrays.toString(nums));
}
private static int[] sortArray(int[] nums) {
int len = nums.length;
int[] temp = new int[len];
mergeSort(nums,0,len-1,temp);
return nums;
}
private static void mergeSort(int[] nums, int left, int right, int[] temp) {
if (left == right){//当拆分到数组当中只要一个值的时候,结束递归
return;
}
int mid = (left+right)/2; //找到下次要拆分的中间值
mergeSort(nums,left,mid,temp);//记录树左边的
mergeSort(nums,mid+1,right,temp);//记录树右边的
//合并两个区间
for (int i = left; i <= right; i++) {
temp[i] = nums[i];
//temp就是辅助列表,新列表的需要排序的值就是从辅助列表中拿到的
}
int i = left; //给辅助数组里面的值标点
int j = mid +1;
for (int k = left; k <= right ; k++) {//k 就为当前要插入的位置
if (i == mid + 1){
nums[k] = temp[j];
j++;
}else if(j == right + 1){
nums[k] = temp[i];
i++;
}else if(temp[i] > temp[j]){
nums[k] = temp[j];
j++;
}else {
nums[k] = temp[i];
i++;
}
}
}
}
4、快速排序
import java.util.Arrays;
public class QuickSort {
public static int partition(int[] array, int low, int high) {
// 取最后一个元素作为中心元素
int pivot = array[high];
// 定义指向比中心元素大的指针,首先指向第一个元素
int pointer = low;
// 遍历数组中的所有元素,将比中心元素大的放在右边,比中心元素小的放在左边
for (int i = low; i < high; i++) {
if (array[i] <= pivot) {
// 将比中心元素小的元素和指针指向的元素交换位置
// 如果第一个元素比中心元素小,这里就是自己和自己交换位置,指针和索引都向下一位移动
// 如果元素比中心元素大,索引向下移动,指针指向这个较大的元素,直到找到比中心元素小的元素,并交换位置,指针向下移动
int temp = array[i];
array[i] = array[pointer];
array[pointer] = temp;
pointer++;
}
}
// 将中心元素和指针指向的元素交换位置
int temp = array[pointer ];
array[pointer] = array[high];
array[high] = temp;
return pointer;
}
public static void quickSort(int[] array, int low, int high) {
if (low < high) {
// 获取划分子数组的位置
int position = partition(array, low, high);
// 左子数组递归调用
quickSort(array, low, position -1);
// 右子数组递归调用
quickSort(array, position + 1, high);
}
}
public static void main(String[] args) {
int[] array = {6,5,4,3,2,1};
quickSort(array, 0, array.length -1);
System.out.println("排序后的结果");
System.out.println(Arrays.toString(array));
}
}
5、希尔排序
import java.util.Arrays;
public class ShellSort_1 {
public static void main(String[] args) {
int[] arr = new int[]{6,5,4,3,2,1};
shellSort(arr);
System.out.println(Arrays.toString(arr));
}
private static int[] shellSort(int[] arr) {
if (arr == null || arr.length <= 1){
return arr;
}
for (int d = arr.length / 2;d > 0;d = d / 2){
for (int i = d;i <arr.length;i++){
for (int j = i - d;j >= 0;j = j - d){
if (arr[j] > arr[j + d]){
int tem = arr[j];
arr[j] = arr[j + d];
arr[j + d] = tem;
}
}
}
}
return arr;
}
}
6、堆排序
import java.util.Arrays;
public class Test_4 {
public static void main(String[] args) {
int[] arr = new int[]{6,5,4,3,2,1};
for (int p = arr.length-1;p>=0;p--){
adjust(arr,p,arr.length);
}
for (int i =arr.length-1;i>=0;i--){
// swap(arr[0],arr[i]);
int temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
adjust(arr,0,i);
}
System.out.println(Arrays.toString(arr));
}
private static void swap(int i, int i1) {
int tem = i;
i = i1;
i1 = tem;
}
public static void adjust(int[] arr,int parent,int length){
int lChild = 2 * parent + 1;
while (lChild < length){
int rChild = lChild + 1;
if(rChild < length && arr[rChild] > arr[lChild]){
lChild++;
}
if(arr[parent] < arr[lChild]){
int temp = arr[parent];
arr[parent] = arr[lChild];
arr[lChild] = temp;
// swap(arr[parent],arr[lChild]);
parent = lChild;
lChild = 2 * lChild + 1;
}
else {
break;
}
}
}
}
7、简单选择排序
import java.util.Arrays;
public class SelectSort {
public static void main(String[] args) {
int[] arr = new int[]{4,2,3,1,1};
slectSort(arr);
System.out.println(Arrays.toString(arr));
}
private static void slectSort(int[] arr) {
for (int i = 0;i<=arr.length-1;i++){
for (int j = i+1;j<=arr.length-1;j++){
if(arr[i]>arr[j]){
int tem = arr[i];
arr[i] = arr[j];
arr[j] = tem;
}
}
}
}
}