选择和插入排序

package com.my;

public class Sort {

    //插入排序
    public void insertSort(int[] arr){
        int i,j,len=arr.length;
        for (i = 1; i < len; ++ i){
            int key = arr[i];
            j = i-1;
            while (key < arr[j] && j>=0){
                arr[j+1] = arr[j];
                j--;
            }
            arr[j+1] = key;
        }
    }


    public void selectSort(int[] arr){
        int i,j,min,len=arr.length;
        for (i=0; i<len-1;++i){
            min = i;
            for (j=i+1; j<len;++j){
                if (arr[j] < arr[min]){
                    min = j;
                }
            }
            if (min != i){
                int tmp = arr[i];
                arr[i] = arr[min];
                arr[min] = tmp;
            }
        }
    }


    public static void main(String[] args) {
        int[] arr = {1,3,8,2,80,1,2,34};
        Sort sort = new Sort();
        int[] arr1 = arr.clone();
        int[] arr2 = arr.clone();
        sort.insertSort(arr1);
        for (int i : arr1) {
            System.out.print(i+",");
        }
        System.out.println();
        sort.selectSort(arr2);
        for (int i : arr2) {
            System.out.print(i+",");
        }
    }
}