选择、冒泡、插入、直接排序算法

标签：intlengthquickpreonergsringmainalt

1 public class Demo {
2
3 public static void main(String[] args) {
4 int[] arr = new int[10];
5 for (int i = 0; i < arr.length; i++) {
6 Random rd = new Random();
7 arr[i] = rd.nextInt(100);
8 }
9 System.out.println(\”需排序数组–>\”);
10 for (int j = 0; j < arr.length; j++) {
11 System.out.print(arr[j] + \”\\t\”);
12 }
13 System.out.println();
14 System.out.println();
15
16 //选择排序
17 for (int i = 1; i < arr.length; i++) {
18 int max = 0;
19 for (int j = 0; j <= arr.length-i; j++) {
20 if(arr[j]>arr[max]){
21 max = j;
22 }
23 }
24 int temp = arr[arr.length-i];
25 arr[arr.length-i] = arr[max];
26 arr[max] = temp;
27 }
28 System.out.println(\”选择排序结果–>\”);
29 for (int j = 0; j < arr.length; j++) {
30 System.out.print(arr[j] + \”\\t\”);
31 }
32 System.out.println();