java Programming Glossary: isprime

Most elegant way to generate prime numbers

http://stackoverflow.com/questions/1042902/most-elegant-way-to-generate-prime-numbers

int nextPrime int primes primes.Count 1 2 while true bool isPrime true foreach int n in primes if nextPrime n 0 isPrime false.. isPrime true foreach int n in primes if nextPrime n 0 isPrime false break if isPrime break else nextPrime 2 primes.Add.. in primes if nextPrime n 0 isPrime false break if isPrime break else nextPrime 2 primes.Add nextPrime return primes..

Project Euler #3 takes forever in Java

http://stackoverflow.com/questions/12025378/project-euler-3-takes-forever-in-java

0 start System.currentTimeMillis for int i 2 i num i if isPrime i if num i 0 pFactor i end System.currentTimeMillis totalTime.. System.out.println pFactor Time totalTime static boolean isPrime long n for int i 2 i n i if n i 0 return false return true..

Memory overhead of Java HashMap compared to ArrayList

http://stackoverflow.com/questions/1526596/memory-overhead-of-java-hashmap-compared-to-arraylist

Payload private int primes new int 128 static boolean isPrime int n for int i int Math.sqrt n i 2 i if n i 0 return false.. I admit map.add null int n 31 for int i 0 i 128 i while isPrime n n 2 primes i n n 2 System.out.println Capacity map.size..

What would be the fastest method to test for primality in Java?

http://stackoverflow.com/questions/2385909/what-would-be-the-fastest-method-to-test-for-primality-in-java

Is there any better way than the second implementation isPrime2 public class Prime public static boolean isPrime1 int n if.. isPrime2 public class Prime public static boolean isPrime1 int n if n 1 return false if n 2 return true for int i.. n i 0 return false return true public static boolean isPrime2 int n if n 1 return false if n 2 return true if n 2 0..

Calculating and printing the nth prime number

http://stackoverflow.com/questions/9625663/calculating-and-printing-the-nth-prime-number

count for candidate 2 count 0 count n candidate if isPrime candidate count The candidate has been incremented once after.. the interesting part that determines the efficiency is the isPrime function. The obvious way for a primality check given the definition.. of the definition into code is private static boolean isPrime int n for int i 2 i n i if n i 0 We are naive but not stupid..