Java实现插入排序

package xiaoling;
public class InsertSort{
        public static void main(String[] args){
                int[] nums = new int[10];
                for (int loc=0; loc<nums.length; ++loc)
                        nums[loc] = (int)(Math.random() * 100) + 5;
                for (int num: nums) System.out.print(num + " ");
                System.out.println();
                new InsertSort().insertSort(nums, 0, nums.length);
                for (int num: nums) System.out.print(num + " ");
                System.out.println();
        }
        public void insertSort(int[] nums, int start, int end){
                for (int i=start; i<end; ++i){
                        int temp = nums[i];
                        int j = i;
                        for (; j>start; --j){
                                if (nums[j-1] > temp) 
                                        nums[j] = nums[j-1];
                                else 
                                        break;  
                        }
                        nums[j] = temp;
                }
        }
}