编写一个程序，然后按降序显示小于120的所有素数。使用StackOfIntegers类储存这些素数（例如：2、3、5、······），获取之后按逆序显示它们（Java）

程序

public class homeWork1 {
	public static void main(String[] args) {
		StackOfIntegers stack = new StackOfIntegers(31);
		int[] array = new int[31];
		int k=0;
		for(int i=120;i>=2;i--) {
			for(int j=2;j<=Math.sqrt(i);j++) {
				if(i%j==0) {
					k=1;
					break;
				}
			}
			if(k==0) {
				System.out.print(i+" ");
				stack.push(i);
			}
			k=0;
		}
		System.out.println();
		for(int n=0; n<=29; n++) {
			array[n] = stack.pop();
		}
		for(int i=29; i>=0; i--) {
			System.out.print(array[i]+" ");
		}
	}
}

StackOfIntegers类

public class StackOfIntegers {
	private int[] elements;
	private int size;
	public static final int DEFAULT_CAPACITY = 16;
	
	public StackOfIntegers() {
		this(DEFAULT_CAPACITY);
	}
	public StackOfIntegers(int capacity) {
		elements = new int[capacity];
	}
	public void push(int value) {
		if(size >= elements.length) {
			int[] temp = new int[elements.length*2];
			System.arraycopy(elements, 0, temp, 0, elements.length);
			elements = temp;
		}
		elements[size++] = value;
	}
	public int pop() {
		return elements[--size];
	}
	public int peek() {
		return elements[size-1];
	}
	public boolean empty() {
		return size == 0;
	}
	public int getSize() {
		return size;
	}
}