70.冒泡排序的基础算法

package test1;

import java.util.Arrays;

public class testBubbleSort {
	public static void main(String[] args) {
		int[] values = {3, 1, 6, 2, 9, 0, 7, 4, 5, 8};
		bubbleSort(values);
		System.out.println(Arrays.toString(values));
		int[] values2 = {3, 1, 6, 2, 9, 0, 7, 4, 5, 8};
		bubbleSort2(values2);
		System.out.println(Arrays.toString(values2));
	}
	
	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])
					swap(arr, j, j+1);
			}
		}
	}
	
	static void swap(int[] arr, int i, int j) {
		int tmp = arr[i];
		arr[i] = arr[j];
		arr[j] = tmp;
	}
	
	
	static void bubbleSort2(int[] arr) {
		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])
					swap(arr, j, j+1);
			}
		}
	}
	
}

来源：CSDN

作者：云疏不知数

链接：https://blog.csdn.net/qq_43808700/article/details/104157000