JAVA冒泡、选择、插入、快速排序代码

冒泡排序

import java.awt.*;
import java.util.Random;

public class bubblingSort {
	public static void bubblingsort(int[] array){
		int temp;
		for (int i=0; i<array.length;i++){
			for (int j=0;j<array.length-i-1;j++){
				if(array[j]>array[j+1]){
					temp=array[j];
					array[j]=array[j+1];
					array[j+1]=temp;
				}
			}
		}
	}

	public static void main(String[] args) {
		int[] shuzu=new int[10];
		Random r=new Random();
		for (int i=0;i<10;i++){
			shuzu[i]=(r.nextInt(100));
		}
		System.out.println("随机生成数组：");
		for (int i:shuzu){
			System.out.println(i+"");
		}
		bubblingsort(shuzu);
		System.out.println("冒泡排序后数组：");
		for (int i:shuzu){
			System.out.println(i+"");
		}
	}
}

选择排序

import java.util.Random;

public class selectSort {
	public static void selectsort(int[] array){
		for (int i=0;i<array.length;i++){
			int minIndex=i;
			int temp;
			for (int j=i+1;j<array.length;j++){
				if (array[j]<array[minIndex]){
					temp=array[j];
					array[j]=array[minIndex];
					array[minIndex]=temp;
				}
			}
		}
	}

	public static void main(String[] args) {
		int[] shuzu=new int[10];
		Random r=new Random();
		for (int i=0;i<10;i++){
			shuzu[i]=(r.nextInt(100));
		}
		System.out.println("随机生成数组：");
		for (int i:shuzu){
			System.out.println(i+"");
		}
		selectsort(shuzu);
		System.out.println("选择排序后数组：");
		for (int i:shuzu){
			System.out.println(i+"");
		}
	}
}

插入排序

public class InsertSort {
	public static void insertSort(int[] array) {
		int tmp;
		for (int i = 1; i < array.length; i++) {
			for (int j = i; j > 0; j--) {
				if (array[j] < array[j-1]) {
					tmp=array[j];
					array[j]=array[j-1];
					array[j-1]=tmp;
				}
			}
		}
	}


	public static void main(String[] args) {
		int[] array = {1, 4, 3, 2, 9};
		insertSort(array);
		for (int i:array){
			System.out.println(i+"");
		}
	}
}

快速排序

import java.util.Random;

public class quickSort {
	//以low为基准
	public static void quicksort(int[] arr,int low,int high){
		int i,j,temp,t;
		if (low>high){
			return;
		}
		i=low;
		j=high;
		temp=arr[low];

		while (i<j){
			while (temp<=arr[j]&&i<j){
				j--;
			}
			while (temp>=arr[i]&&i<j){
				i++;
			}
			if (i<j){
				t=arr[j];
				arr[j]=arr[i];
				arr[i]=t;
			}
		}
		arr[low]=arr[i];
		arr[i]=temp;
		quicksort(arr,low,j-1);
		quicksort(arr,j+1,high);
	}

	public static void main(String[] args) {
		int[] shuzu=new int[10];
		Random r=new Random();
		for (int i=0;i<10;i++){
			shuzu[i]=(r.nextInt(100));
		}
		System.out.println("随机生成数组：");
		for (int i:shuzu){
			System.out.println(i+"");
		}
		quicksort(shuzu,0,shuzu.length-1);
		System.out.println("快速排序后数组：");
		for (int i:shuzu){
			System.out.println(i+"");
		}
	}
}

 

有什么问题的话欢迎指出来~~~  ：）