public void sort(int[] nums) {
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            int minIndex = i;
            int min = nums[i];
            for (int j = i + 1; j < n; j++) {
                if(nums[j] < min) {
                    min = nums[j];
                    minIndex = j;
                }
            }
            swap(nums,i,minIndex);
        }
}
private void swap(int[] nums,int left,int right) {
        int tmp = nums[left];
        nums[left] = nums[right];
        nums[right] = tmp;
}