(java笔试不得不会的五种排序算法.docVIP

java笔试不得不会的五种排序算法 数据结构课程 一，冒泡排序：package com.sort; import java.util.Random; public class No1Maopao {??? public static void main(String[] args) {??????? Random rd = new Random();//生成随即数组??????? int [] src = new int[10];??????? for(int i=0;i10;i++){??????????? src[i]=rd.nextInt(100);??????? }//排序前打印数组所有元素??????? for(int i:src)??????????? System.out.println(i);??????? System.out.println(---------------可爱的分割线-------------------);??????? src = sort(src);//排序后打印数组所有元素??????? for(int i:src)??????????? System.out.println(i);??? } ??? public static int[] sort(int [] src){??????? for (int i = 0; i src.length; i++) {??????????? for(int j=i;jsrc.length;j++){??????????????? if(src[j]src[i]){??????????????????? int temp = src[j];??????????????????? src[j]=src[i];??????????????????? src[i]=temp;??????????????? }??????????? }??????? }??????? return src;??? }}二、选择排序：package com.sort; import java.util.Random; public class No2XuanZhe {??? public static void main(String[] args) {??????? Random rd = new Random();??????? int[] src = new int[10];??????? for (int i = 0; i 10; i++) {??????????? src[i] = rd.nextInt(100);??????? }??????? for (int i : src)??????????? System.out.println(i);??????? System.out.println(---------------可爱的分割线-------------------);??????? src = sort(src);??????? for (int i : src)??????????? System.out.println(i);??? } ??? public static int[] sort(int[] src) {??????? int min;??????? for (int i = 0; i src.length; i++) {??????????? min = src[i];??????????? for (int j = i + 1; j src.length; j++) {??????????????? if (src[j] min) {??????????????????? min = src[j];??????????????????? int temp = src[i];??????????????????? src[i] = src[j];??????????????????? src[j] = temp;??????????????? }??????????? }??????? }??????? return src;??? }}三、插入排序：package com.sort; import java.util.Random; public class No3ChaRu {??? public static void main(String[] args) {??????? Random rd = new Random();??????? int[] src = new int[