算法导论第2章：算法入门--插入排序

Jimi — Tue, 18 Feb 2014 15:23:00 GMT

public class InsertionSortAlgorithmTest {

    public static String arrayToString(int[] array){
       StringBuilder sb = new StringBuilder();
        for(int a:array){
            sb.append(a).append(" ");
        }
        return sb.toString();
    }

    public static int[] insertionSort(int[] array){
        int key;
        int j;
        for (int i = 1; i < array.length; i++) {
            key = array[i];
            j = i - 1;
            while (j >= 0 && array[j] > key) {
                array[j + 1] = array[j];
                j = j - 1;
            }
            array[j + 1] = key;
            System.out.println(arrayToString(array));
        }
        return array;
    }

    public static void main(String[] args) {
        int[] array = {2, 3, 1, 7, 5, 9, 4, 6, 8};
        insertionSort(array);
    }

}

Jimi 2014-02-18 23:23 发表评论

斐波那契数列

Jimi — Fri, 25 Jan 2013 03:15:00 GMT

import java.util.ArrayList;
import java.util.Calendar;

public class CAL {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Calendar start = Calendar.getInstance();
        System.out.println(start.getTimeInMillis());
        ArrayList number = new ArrayList();
        number.add(1);number.add(1);
        for (int i = 2; i <= 100000; i++) {
            number.add(number.get(i - 1) + number.get(i - 2));
        }
        Calendar end = Calendar.getInstance();
        System.out.println(end.getTimeInMillis());
        System.out.println("时间：" + (end.getTimeInMillis()-start.getTimeInMillis() ));
        System.out.println("last:"+number.get(100000));
    }

}

Jimi 2013-01-25 11:15 发表评论

BlogJava-码农往事-随笔分类-算法

算法导论第2章：算法入门--插入排序

斐波那契数列