hlju.Java.Homework_Week1 二分插入法排序

学习通上面的Java作业Week 1

---

基本思路是
从后往前一直和数组中间的元素比较大小
如果比中值小再继续与小的数组的中值比较
直到这个组的元素数量==2
这时候跳出循环
将所有大于这个数字的元素向后移动一位
将这个元素插入到这个空档中
之后继续循环
逐渐扩大数组有序部分
直到完成整个数组的排序

---

下面是程序代码

public class Homework {
    public static void main(String[] args) {
        int[] i = {1, 4, 7, 2, 5, 8, 3, 6, 9};
        Sort sort = new Sort(i);
//        Arrays.sort();
        System.out.println(Arrays.toString(i));
    }
}
/** Week one homework.
 * @author Hiroomi
 * @version 1.1
 */
class Sort{
    /**
     * To int long float double
     * @param arr The array you want sort.
     */
    public Sort(int[] arr){
        for (int i = 1; i < arr.length; i++) {
            int temp = arr[i];
            int low = 0, high = i - 1;
            int mid;
            while (low <= high) {
                mid = low + (high - low) / 2;
                if (arr[mid] > temp) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            for(int j = i - 1; j >= low; j--) {
                arr[j + 1] = arr[j];
            }
            arr[low] = temp;
        }
    }
    public Sort(long[] arr){
        for (int i = 1; i < arr.length; i++) {
            long temp = arr[i];
            int low = 0, high = i - 1;
            int mid;
            while (low <= high) {
                mid = low + (high - low) / 2;
                if (arr[mid] > temp) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            for(int j = i - 1; j >= low; j--) {
                arr[j + 1] = arr[j];
            }
            arr[low] = temp;
        }
    }
    public Sort(float[] arr){
        for (int i = 1; i < arr.length; i++) {
            float temp = arr[i];
            int low = 0, high = i - 1;
            int mid;
            while (low <= high) {
                mid = low + (high - low) / 2;
                if (arr[mid] > temp) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            for(int j = i - 1; j >= low; j--) {
                arr[j + 1] = arr[j];
            }
            arr[low] = temp;
        }
    }
    public Sort(double[] arr){
        for (int i = 1; i < arr.length; i++) {
            double temp = arr[i];
            int low = 0, high = i - 1;
            int mid;
            while (low <= high) {
                mid = low + (high - low) / 2;
                if (arr[mid] > temp) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            for(int j = i - 1; j >= low; j--) {
                arr[j + 1] = arr[j];
            }
            arr[low] = temp;
        }
    }
}