BlogJava-忆风-随笔分类-数据结构与算法

Base64 算法

忆风 — Wed, 17 Sep 2008 03:44:00 GMT

摘要: public class Base64 { private static final char[] S_BASE64CHAR = { 'A', 'B',... 阅读全文

忆风 2008-09-17 11:44 发表评论

递归－阶乘

忆风 — Sat, 30 Aug 2008 20:00:00 GMT

public class Factorial {
    public static void main(String[] args) {
        for (int i = 1; i < 10; i++)
            System.out.print(getNext(i) + " ");
    }

    public static int getNext(int n) {
        if (n == 1) return 1;
        return n * getNext(n - 1);
    }
}

忆风 2008-08-31 04:00 发表评论

质数

忆风 — Sat, 30 Aug 2008 19:51:00 GMT

public class PrimeNumber {
    public static void main(String[] args) {
        int count = 1;
        int number = 2;
        boolean isPrime = true;
        System.out.println("The First prime numbersare \n");
        while (count <= 100) {
            isPrime = true;
            int tempSqrt = (int) Math.sqrt(number);
            for (int divisor = 2; divisor <= tempSqrt; divisor++) {
                if (number % divisor == 0) {
                    isPrime = false;
                    break;
                }
            }
            if (isPrime) {
                if (count % 10 == 0) {
                    System.out.println(number);
                } else
                    System.out.print(number + "   ");
                count++;
            }
            number++;
        }
    }
}

忆风 2008-08-31 03:51 发表评论