printprime.java

是<java程序设计>的课后作业2-8源码.可以供初学者参考,作了解java基础语法所用.

/**
 * @(#)PrintPrime.java
 *
 *
 * @author 
 * @version 1.00 2009/3/18
 */

public class PrintPrime {
        
    /**
     * Creates a new instance of <code>PrintPrime</code>.
     */
    public PrintPrime() {
    }
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        
        
        //新建一个整数堆栈,不经测试并将2和3作为整数压入栈中
        StackOfIntegers primeStack=new StackOfIntegers(20);
        primeStack.push(2);
        primeStack.push(3);
        
        for(int i=4;i<120;i++)
        {
        	int squareRoot=(int)Math.sqrt(i);
        	int j=0;
        	for(j=2;j<=squareRoot;j++)
        	{
        		if(i%j==0)
        			break;
        	}
        	
        	if(j>squareRoot)
        		primeStack.push(i);
        }
        
        
        //借助栈,逆序输出素数
        int counter=0;
        while(!primeStack.empty())
        {
        	
        	System.out.print(primeStack.pop()+"  ");
        	counter++;
        	if(counter%5==0)
        		System.out.print("\n");
        }
    }
}