Thread: Need a more efficient algorithm for prime numbers.

Here is my current algorithm, the TimeExec is just a class to print out how long it takes to run the code:

public class Primes {
 
	/**
	 * Get a set of prime numbers.
	 * @param no the number of primes to create
	 * @return an array containing the requested number
	 * of primes
	 */
	public static int[] getPrimes(int no) {
		int[] primes = new int[no];
		int primeInx = 0;
		int i = 2;
 
		if (primeInx < no) {
			primes[primeInx++] = 1;
		}
 
		while (primeInx < no) {
			boolean prime = true;
			for (int j = 2; j < i; j++) {
 
				if (i == i / j * j) {
					prime = false;
				}
			}
			if (prime) {
				primes[primeInx++] = i;
			}
			i++;
		}
 
		return primes;
	}
 
	public static void main(String[] args) {
		new TimeExec(new Runnable() {
			public void run() {
				int[] primes = getPrimes(1000);
			}
		}, "Get 1,000 primes", System.out).start();
 
		//the 10,000 primes took the library's lab comp 19.125s
		new TimeExec(new Runnable() {
			public void run() {
				int[] primes = getPrimes(10000);
			}
		}, "Get 10,000 primes", System.out).start();
 
		new TimeExec(new Runnable() {
			public void run() {
				int[] primes = getPrimes(100000);
			}
		}, "Get 100,000 primes", System.out).start();
 
//		new TimeExec(new Runnable() {
//			public void run() {
//				int[] primes = getPrimes(1000000);
//			}
//		}, "Get 1,000,000 primes", System.out).start();
	}
}

I need to get it to be able to print out the 1,000,000 primes fairly quickly. Any help would be awesome, thank you!