选择排序
代码实现:
public class SelectionSort {
/**
* 选择排序
*
* @param arr
*/
public static void sort(int arr[]) {
/********** Begin *********/
for(int i = 0;i < arr.length - 1;i++){
for(int j = i+1;j < arr.length;j++){
if(arr[i] > arr[j]){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
print(arr);
}
/********** End *********/
}
private static void print(int arr[]) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
}
}
插入排序
public class InsertionSort {
public static void sort(int arr[]) {
/********** Begin *********/
for (int i = 1;i < arr.length;i++){
int value = arr[i];
int index = i - 1;
while (index >= 0 && value < arr[index]){
arr[index+1] = arr[index];
i