几种排序算法

 1 package other;
 2 
 3 /*
 4  * 几种排序算法
 5  */
 6 public class Sort {
 7     /* 冒泡排序 */
 8     public void maoPao(int[] arr) {
 9 
10         int tem = 0;
11         for (int i = 0; i < arr.length; i++) {
12             for (int j = 0; j < arr.length - i - 1; j++) {
13                 if (arr[j] > arr[j + 1]) {
14                     tem = arr[j];
15                     arr[j] = arr[j + 1];
16                     arr[j + 1] = tem;
17                 }
18             }
19         }
20         System.out.print("冒泡排序：");
21         for (int i = 0; i < arr.length; i++) {
22             System.out.print(arr[i] + " ");
23         }
24     }
25 
26     /* 选择排序 */
27     public void xuanZe(int[] arr) {
28 
29         for (int i = 0; i < arr.length; i++) {
30             int min = arr[i];
31             int n = i; // 最小数的索引
32             for (int j = i + 1; j < arr.length; j++) {
33                 if (arr[j] < min) { // 找出最小的数
34                     min = arr[j];
35                     n = j;
36                 }
37             }
38             arr[n] = arr[i];
39             arr[i] = min;
40 
41         }
42         System.out.print("选择排序：");
43         for (int i = 0; i < arr.length; i++) {
44             System.out.print(arr[i] + " ");
45         }
46     }
47 
48     /* 插入排序 */
49     public void chaRu(int[] arr) {
50 
51         for (int i = 1; i < arr.length; i++) {
52             int currentValue = arr[i];
53             int position = i;
54             for (int j = i - 1; j >= 0; j--) {
55                 if (arr[j] > currentValue) {
56                     arr[j + 1] = arr[j];
57                     position -= 1;
58                 } else {
59                     break;
60                 }
61             }
62 
63             arr[position] = currentValue;
64         }
65         System.out.print("插入排序：");
66         for (int i = 0; i < arr.length; i++) {
67             System.out.print(arr[i] + " ");
68         }
69     }
70 
71     public static void main(String[] args) {
72 
73         int[] array = { 43, 26, 22, 19, 74, 5, 31, 8 };
74         Sort sort = new Sort();
75 
76         sort.maoPao(array);
77         System.out.println(" ");
78 
79         sort.xuanZe(array);
80         System.out.println(" ");
81 
82         sort.chaRu(array);
83         System.out.println(" ");
84 
85     }
86 }