自用:直接插入排序算法(java)

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class homework {
    int[] data = new int[5];//创建一个长度为5的数组
    int size = data.length;//获取数组的长度,将它赋值给size

    public static void main(String[] args) {
        homework test = new homework();
        test.inputarr();
        System.out.print("你输入的原始的数组是:");
        test.showdata();
        test.insert();
    }

    void inputarr() {//创建一个插入的方法,用来接收数据
        int i;
        for (i = 0; i < size; i++) {
            try {
                System.out.print("请输入第" + (i + 1) + " 个数据:");
                InputStreamReader isr = new InputStreamReader(System.in);
                BufferedReader br = new BufferedReader(isr);
                data[i] = Integer.parseInt(br.readLine());
            } catch (Exception e) {}
        }
    }

    void showdata() {//显示数组
        int i;
        for (i = 0; i < size; i++) {
            System.out.print(data[i] + " ");
        }
        System.out.println("\n");
    }

    void insert() {
        int i;
        int j;
        int tmp;
        for (i = 1; i < size; i++) {
            tmp = data[i];
            j = i - 1;
            while (j >= 0 && tmp < data[j]) {
                data[j + 1] = data[j];
                j--;
            }
            data[j + 1] = tmp;
            System.out.print("结果为:");
            showdata();
        }
    }
}