Java基本排序（插入排序，冒泡排序，选择排序）

来源：互联网发布：为什么卸载不了软件编辑：程序博客网时间：2024/05/18 09:20
/** * 插进入排序 * @author shuang * */public class InsertSort {public static void insertSort(int[] array) {for (int i=1;i<array.length;i++) {for (int j=0;j<i;j++) {if (array[j]>array[i]) {int temp = array[i];for (int k=i;k>j;k--) {array[k]=array[k-1];}array[j]=temp;}}}}public static void print(int[] array) {for (int i=0;i<array.length;i++) {System.out.print(array[i]+" ");}System.out.println();}public static void main(String[] args) {int[] array = {3,1,5,8,6,12,56,2,64,90,51};print(array);System.out.println("----------排序后---------");    insertSort(array);print(array);}}/** * 交换排序 * @author shuang * */public class ExchangeSort {public static void exchangeSort(int[] array) {for (int i=0;i<array.length-1;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;}}}}public static void print(int[] array) {for (int i=0;i<array.length;i++) {System.out.print(array[i]+" ");}System.out.println();}public static void main(String[] args) {int[] array = {3,1,5,8,6,12,56,2,64,90,51};print(array);System.out.println("----------排序后---------");    exchangeSort(array);print(array);}}/** * 选择排序 * @author shuang * */public class SelectSort {public static void selectSort(int[] array) {for (int i=0;i<array.length-1;i++) {for (int j=i+1;j<array.length;j++) {if (array[j]<array[i]) {int temp = array[j];array[j] = array[i];array[i] = temp;}}}}public static void print(int[] array) {for (int i=0;i<array.length;i++) {System.out.print(array[i]+" ");}System.out.println();}public static void main(String[] args) {int[] array = {3,1,5,8,6,12,56,2,64,90,51};print(array);System.out.println("----------排序后---------");    selectSort(array);print(array);}}
0 0