Java 2017.11.20 杨浩宁作业

package top.hyself;
//斐波那契数列
public class Demo {

    public static void main(String[] args) {
        int[] arr = new int [30];
        arr[0] = 1;
        arr[1] = 1;
        for(int i = 2;i < arr.length;i++)
            arr[i] = arr[i - 1] + arr[i - 2];
        for(int i : arr)
            System.out.println(i);
    }

}

---

package top.hyself;
//人类对象数组
public class Demo {

    public static void main(String[] args) {
        human hm[] = new human[3];
        hm[0] = new human("小明",19);
        hm[1] = new human("小红",18);
        hm[2] = new human("小志",20);
        for(int i = 0;i < hm.length;i++)
            hm[i].getInfo();
    }

}

class human{
    private String name;
    private int age;
    public human(String name,int age) {
        this.name = name;
        this.age = age;
    }
    public void getInfo() {
        System.out.println("姓名：" + this.name + " 年龄：" + this.age);

    }
}

 

---

package top.hyself;
//选择排序法
public class Demo {

    public static void main(String[] args) {
        int[] arr = {1,5,6,7,9,8,3,0,2,4};
        for(int i = 0;i < arr.length;i++) {
            for(int j = i + 1;j < arr.length;j++) {
                if(arr[i] < arr[j]) {
                    int temp = arr[i];
                    arr[i] = arr[j];
                    arr[j] = temp;
                }
            }

        }
        for(int i : arr)
            System.out.println(i);
    }
}

 

---

 

package top.hyself;
//冒泡排序法
public class Demo {

    public static void main(String[] args) {
        int[] arr = {1,5,6,7,9,8,3,0,2,4};
        for(int i = 0;i < arr.length;i++) {
            for(int j = 0;j < arr.length - 1 -i;j++) {
                if(arr[j] < arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }

        }
        for(int i : arr)
            System.out.println(i);
    }
}

 

小游戏：