Optimize PrimeFactors

prabhat2718 · Apr 12, 2017 · 8bcde5e · 8bcde5e
1 parent da10d96
commit 8bcde5e
Showing 1 changed file with 3 additions and 3 deletions.
diff --git a/UVa/PrimeFactors.java b/UVa/PrimeFactors.java
@@ -62,20 +62,20 @@ public class PrimeFactors {
 	public static void main(String[] args) {
 		Scanner input = new Scanner(System.in);
 		int number = input.nextInt();
+		boolean[] isPrime = generatePrimeNumbers();
 		while (number != 0) {
 			boolean isNegative = false;
 			if (number < 0) {
 				isNegative = true;
 				number = Math.abs(number);
 			}
 			int originalNumber = number;
-			formatOutput(originalNumber, sieveOfEratosthenes(originalNumber), isNegative);
+			formatOutput(originalNumber, sieveOfEratosthenes(isPrime, originalNumber), isNegative);
 			number = input.nextInt();
 		}
 	}
 
-	public static List<Integer> sieveOfEratosthenes(int number) {
-		boolean[] isPrime = generatePrimeNumbers();
+	public static List<Integer> sieveOfEratosthenes(boolean[] isPrime, int number) {
 		List<Integer> primeFactors = new ArrayList<Integer>();
 		int squareRootOfOriginalNumber = (int) Math.sqrt(number);
 		for (int i = 2; i <= squareRootOfOriginalNumber; i++) {