正反序列显示所在区间的素数

package FOO;
import java.util.Scanner;
public class TestFoo {

	/*private static int i=0;
	private static int j=0;*/
	public static void main(String[] args){

		System.out.println("请输入素数的所在范围：");
		Scanner inputsushu=new Scanner(System.in);
		int newinput=inputsushu.nextInt();
		int sushuArray[]=new int[newinput];
		int p=0;
		for(int i=2;i<=newinput;i++){
			int k=0;
			for(int j=1;j<=i;j++){
				if((i%j)==0){
					k++;
				}
			}
			if(k==2){
				sushuArray[p]=i;
				p++;
			}
		}
		System.out.println("正序列显示素数组:");
		ZArray(sushuArray);
		System.out.println();
		System.out.println("反序列显示素数组：");
		DArray(sushuArray);
	}
	
	//------------------------------------------
	public static void ZArray(int[] array){    //正序显示数组
		for(int i=0;i<array.length;i++){
			if(array[i]!=0){
			System.out.print(array[i]+",");
			}
		}
	}
	
	public static void DArray(int[] array){   //倒序显示数组
		for(int j=0;j<array.length;j++){
			if(array[array.length-j-1]!=0){
			System.out.print(array[array.length-j-1]+",");
			}
		}
	}
}