JAVA_递归_选择排序_冒泡排序

 1 import java.util.Arrays;
 2 
 3 public class Test {
 4     public static void main(String[] args) {
 5         int []array = new int [15] ;
 6         for (int i = 0; i < array.length; i++) {
 7             //产生随机数组
 8             array[i] = (int)(Math.random()*100);
 9         }
10         System.out.println("排序前："+Arrays.toString(array));
11         choiceSort(array);                    //执行选择排序
12 //        bubbleieSort(array);                //执行冒泡排序
13 //        System.out.println(getAdd(10));        //递归累加
14         System.out.println("排序后："+Arrays.toString(array));
15     }
16     
17     //递归累加
18     public static int getAdd(int a) {
19         if(a == 1) {
20             return 1;
21         }
22         return  a+getAdd(a-1);
23     }
24     
25     //选择排序
26     public static void choiceSort(int[] array) {
27         System.out.println("==============选择排序==============");
28         int sum = 0;
29         for (int i = 0; i < array.length -1; i++) {
30             for (int j = i+1; j < array.length; j++) {
31                 if(array[i] > array[j]) {
32                     sum = array[i];
33                     array[i] = array[j];
34                     array[j] = sum;
35                 }
36             }
37         }
38     }
39     
40     //冒泡排序
41     public static void bubbleieSort(int[] array) {
42         System.out.println("==============冒泡排序==============");
43         int sum = 0;
44         for (int i = 0; i < array.length-1 ; i++) {
45             for (int j = 0; j < array.length-1-i; j++) {
46                 if(array[j] > array[j+1]) {
47                     sum = array[j];
48                     array[j]  = array[j+1];
49                     array[j+1] = sum;
50                 }
51             }
52         }
53     }
54 }