View difference between Paste ID: 0MLLTYym and r7gdBGq9

 import java.util.ArrayList;
 public class Prime_Counter {
 	static ArrayList<Integer> primes = new ArrayList<Integer>();
-	static int prime, target = 2, basePrime = 1, largestFactor, nextTest = 1;
+	static int target = 10001;
 
 	public static void main(String[] args) {
-		System.out.println("" + prime(basePrime) + " is the " + target + " prime.");
+
 
 		while (primes.size() != target){
-	public static int prime(int x)
+			next();
-	{
+		}// end of primes while
-		System.out.println("Target is: " + target);
+
-		System.out.println("The size of the primes array is: " + primes.size());
+		System.out.println("" + primes.get(primes.size()-1) + " is the " + target + " prime.");
-		System.out.println("Is " + x + " prime?");
+
-		largestFactor = findLargestFactor(x);
+
 	public static void next(){
-		for (int y = 2; y <= Math.pow(largestFactor, 0.5); y++){
+		int largestPrime = primes.get(primes.size()-1);
-			if(x%y == 0)
+		int z = largestPrime;
 		boolean found = false;
-				System.out.println("" + x + " is not prime.");
+
-				nextTest = nextNumber();
+		while (!found){
-				System.out.println("Next test is: " + nextTest);
+			z++;
-				return prime(nextTest);
+			if (prime(z))
-			}// end of if
+
-		}// end of y for loop
+				found = true;
 				System.out.println("" + z +" is prime.");
-		System.out.println("" + x + " is prime.");
+				primes.add(z);
-		primes.add(x);
+			}
-
+		}// end of y while loop
-		System.out.println("Target is: " + target);
+	}// end of next
-		System.out.println("The size of the primes array is   : " + primes.size());
+
 	public static boolean prime(int x){
-		if(primes.size() == target)
+		System.out.println("Is " + x +" prime?");
-			return primes.get(target-1);
+		for (int y = 2; y <= Math.pow(x, 0.5); y++){
 			if (x%y == 0)
-		nextTest = nextNumber();
+
-
+				System.out.println("" + x +" is not prime.");
-			return prime(nextTest);
+				return false;
 			}
-
+		}// end of for y loop
-	public static int findLargestFactor(int x)
+		return true;
-	{
+
-		for (int y = 2; y <= Math.pow(x, 0.5); y++)
+