
public class Primes {
	
	public static int[] primes_napa(int min, int max){
		boolean[] arr = new boolean[max];
		arr[0] = false;
		arr[1] = false;
		for(int i = 2; i<max; i++){
			arr[i] = true;
		}
		int sqr = (int) (Math.sqrt(max));
		for(int i = 2; i<=sqr; i++){
			if( arr[i] ){
				for(int j = i*2; j<max; j = j+i){
					arr[j] = false;
				}
			}
		}
		
		int n = 0;
		for(int i = min; i<max; i++){
			if( arr[i] ){
				n++;
			}
		}
		
		int[] prime = new int[n];
		n=0;
		for(int i = min; i<max;i++){
			if( arr[i] ){
				prime[n] = i;
				n++;
			}
			
		}
		return prime;

	}
	

}
 