- it
- Java实现插入排序
插入排序
public class InsertionSort {
public static void insertionSort(int[] arr
) {
if (arr
== null
|| arr
.length
< 2) {
return;
}
for (int i
= 1; i
< arr
.length
; i
++) {
for (int j
= i
- 1; j
>= 0 && arr
[j
] > arr
[j
+ 1]; j
--) {
swap(arr
, j
, j
+ 1);
}
}
}
public static void swap(int[] arr
, int i
, int j
) {
int tmp
;
tmp
= arr
[i
];
arr
[i
] = arr
[j
];
arr
[j
] = tmp
;
}
public static void main(String
[] args
) {
int[] arr
= { 2, 3, 6, 1, 8, 5, 5, 6, 0 };
insertionSort(arr
);
for (int i
= 0; i
< arr
.length
; i
++) {
System
.out
.println(arr
[i
]);
}
}
}
