1. public class sort {
   
2. public static long beginTimer;
   
3. public static final int SIZE = 1000;
   
4. 
   
5. public static void main(String[] args) {
   
6. 
   
7. int[] arr = new int[SIZE];
   
8. int i;
   
9. for (i = 0; i < SIZE; i++) {
   
10. arr[i] = (int) (Math.random() * (System.currentTimeMillis() % Integer.MAX_VALUE)); // 初始化数组
    
11. }
    
12. showArray(arr);
    
13. beginTag();
    
14. selectSort(arr);
    
15. endTag("selectSort");
    
16. showArray(arr);
    
17. 
    
18. beginTag();
    
19. bubbleSort(arr);
    
20. endTag("bubbleSort");
    
21. showArray(arr);
    
22. 
    
23. beginTag();
    
24. shellSort(arr);
    
25. endTag("shellSort");
    
26. showArray(arr);
    
27. 
    
28. }
    
29. 
    
30. // 记录排序开始时间
    
31. public static void beginTag() {
    
32. beginTimer = System.currentTimeMillis();
    
33. 
    
34. }
    
35. 
    
36. // 标记排序结束时间
    
37. public static void endTag(String tips) {
    
38. long endTimer = System.currentTimeMillis();
    
39. System.out.println(tips+"排序耗时:" + (endTimer - beginTimer));
    
40. }
    
41. 
    
42. // 选择排序
    
43. public static void selectSort(int arr[]) {
    
44. for (int i = 0; i < arr.length - 1; i++) {
    
45. for (int j = i + 1; j < arr.length; j++) {
    
46. 
    
47. if (arr[i] > arr[j]) {
    
48. int temp = arr[i];
    
49. arr[i] = arr[j];
    
50. arr[j] = temp;
    
51. 
    
52. }
    
53. }
    
54. 
    
55. }
    
56. }
    
57. 
    
58. // 冒泡排序
    
59. public static void bubbleSort(int arr[])
    
60. 
    
61. {
    
62. for (int i = 0; i < arr.length - 1; i++) {
    
63. 
    
64. for (int j = 0; j < arr.length - i - 1; j++) {
    
65. 
    
66. if (arr[j] > arr[j + 1]) {
    
67. int temp = arr[j];
    
68. arr[j] = arr[j + 1];
    
69. arr[j + 1] = temp;
    
70. }
    
71. }
    
72. }
    
73. }
    
74. 
    
75. // Shell排序
    
76. static void shellSort(int[] arr) {
    
77. int i, j, h;
    
78. int r, temp;
    
79. int x = 0;
    
80. 
    
81. for (r = arr.length / 2; r >= 1; r /= 2) // 划组排序
    
82. {
    
83. for (i = r; i < arr.length; i++) {
    
84. temp = arr[i];
    
85. j = i - r;
    
86. while (j >= 0 && temp < arr[j]) {
    
87. arr[j + r] = arr[j];
    
88. j -= r;
    
89. }
    
90. arr[j + r] = temp;
    
91. }
    
92. 
    
93. x++;
    
94. 
    
95. }
    
96. }
    
97. 
    
98. public static void showArray(int arr[]) {
    
99. for (int i = 0; i < arr.length - 1; i++) {
    
100. 
     
101. System.out.print(arr[i] + ",");
     
102. }
     
103. System.out.print("\n");
     
104. }
     
105. }
     

复制代码

selectSort排序耗时:4
bubbleSort排序耗时:6
shellSort排序耗时:0

4,6,0是什么意思？

还有 二分法排序这些都没写吧