选择排序、插入排序、冒泡排序的简单实现

排序算法有很多，其中最容易理解和常见的三种排序算法分别是选择排序、插入排序、冒泡排序，Java实现如下

​
import java.util.ArrayList;
import java.util.Arrays;

public class ShiXian {
	public static void main(String[] args) {
		int array[] = {12,1,5,2,3,9,8};
		selectSort(array);
		insertSort(array);
		bubbleSort(array);
		System.out.println(Arrays.toString(array));
	}

	private static void bubbleSort(int[] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array.length - i - 1; j++) {
				if(array[j]>array[j+1]) {
					int temp = array[j];
					array[j] = array[j+1];
					array[j+1] = temp;
					System.out.println( Arrays.toString(array));
				}
				
			}
			
		}
		
	}

	private static void insertSort(int[] array) {
		ArrayList<Integer> lists = new ArrayList<Integer>();
		lists.add(array[0]);
		for (int i = 1; i < array.length; i++) {
			for (int j = 0; j < lists.size(); j++) {
				if (array[i] < lists.get(j)) {
					lists.add(j, array[i]);
					break;
				}else if(j == lists.size()-1){
					lists.add(array[i]);
					break;
				}else {
					continue;
				}
			}
		}
		for (int i = 0; i < array.length; i++) {
			array[i] = lists.get(i);
		}
	}
	private static void selectSort(int[] array) {
		for (int i = 0; i < array.length; i++) {
			int minIndex = i;
			for (int j = i; j < array.length; j++) {
				if(array[j] < array[minIndex]) {
					minIndex = j;
				}
			}
			int temp = array[i];
			array[i] = array[minIndex];
			array[minIndex] = temp;
		}
	}
}

​