Skip to main content

Prime Numbers

Problem : Given a number, determine if it is prime or not.

To determine if a given number is prime or not, you have to check if the given number is divisible by any number other than 1 and itself. If it is, then it is not a prime number. 

* In this algorithm, we check if the given number is less than or equal to zero. If it is then it is not a prime number. 

* Next we check to see if the given number is 2.  2 is the only even prime number. 

* Then we check if the given number is even. If it is, then it is not a prime number. 

* Lastly we divide the given number starting from 3 till the square root of the given number. 

  /**
     * This method checks if the given number n is a prime number or not.
     *
     * @param n - The number to be checked.
     * @return boolean
     */
    public static boolean isPrime(int n)
    {
        if (n <= 1)
        {
            return false;
        }

        if (n == 2)
        {
            return true;
        }

        if (n % 2 == 0)
        {
            return false;
        }


        int m = (int) Math.sqrt(n);

        for (int i = 3; i <= m; i += 2)
        {
            if (n % i == 0)
            {
                return false;
            }
        }

        return true;
    }

This algorithm has a time complexity of O ( n ) and a space complexity of O ( 1 ).

============================================

Problem : Given an integer n, generate all the prime numbers till n.

This solution uses the isPrime discussed above. 

* In this solution we first create an array of boolean of size n + 1 and fill the array with true. 

* We then know that zero and one are not prime numbers. Hence we mark the first 2 entries to be false.

* Next we start with 2 and then set all multiples of 2 less than the given number to false. At this point, 2 is a prime number and all multiples of 2 are marked false.
   
This is repeated in a loop with increments of 1 till we hit a number lesser than the square root of the given number. So at the end of the second iteration, 3 will be true indicating it is prime and all of it's multiples are marked false and so on.
   

  /**
     * This generates the prime numbers using Sieve of Eratosthenes.
     * @param n
     */
    public static void generatePrime(int n)
    {
        boolean[] isPrime = new boolean[n+1];

        Arrays.fill(isPrime, true);

        isPrime[0] = false;
        isPrime[1] = false;

        for (int i = 2; i <= (int) Math.sqrt(n); i++)
        {
            if (isPrime[i])
            {
                for (int j = i * i; j <= n; j += i)
                {
                    isPrime[j] = false;
                }
            }
        }

        System.out.println("Prime numbers till " + n + " are : \n");

        for (int i = 0; i <>
        {
            if (isPrime[i])
            {
                System.out.println(i);
            }
        }
    }
Labels:

Comments

Post a Comment

Popular posts from this blog

Find the number of trailing zeroes in the factorial of a given number.

Problem : Find the number of trailing zeroes in the factorial of a given number. This is an interesting problem. Simple way to solve this is to find the factorial of the number and then count the number of trailing zeroes. But there is a more efficient way to find the number of trailing zeroes, without even finding the factorial of the number. The number of trailing zeroes in 5! is 1, 10! is 2, 15! is 3, 20! is 4, but 25! is 6. Then 30! is 7, 35! is 8, 40! is 9, 45! is 10 but 50! is 12 and so on. So for every multiple of 25, the number of zeroes increases by 2 and for every multiple of 5, the number of zeroes increase by 1. So any number less than 5 has 0 trailing zeroes. Any number between 5 and 10 will have 1 zero, between 10 and 15 will have 2 zeroes and so on. Here is a simple C program implementation of this algorithm. import java.io.BufferedReader; import java.io.InputStreamReader; /** * * @author blogkoder * */ public class TrailingZeroesCalculator { public static void m...
3 comments
Read more

Minimum Maximum Stack

Problem : Design a stack of Numbers which will give you the minimum and maximum of all the elements it contains. This problem is also known as MinStack or MaxStack problem which expects you to find only the minimum or maximum. It is restated here to capture both. A stack typically has push(), pop() and size() operations. In order to find the minimum and the maximum, we will need to iterate over the elements of the stack each time we want to find the minimum and maximum. This will result in O (n) time complexity. And typically stack does not let us iterate over the elements. Many do not know that the java.util.Stack implementation does allow it as it extends java.util.Vector. We can make it more efficient by storing the minimum and maximum as instance variables in our stack and update them when ever we push a new number on to the stack. This will result in O(1) complexity for updating the max and min when pushing new numbers on stack, but when we pop the number which is currently set a...
Post a Comment
Read more

Find missing integer problem

Problem : G iven an array of size 99 which has integers from 1 to 100 and with no integer being repeated, can you find the integer which is not in the array ? There are many differeny ways of solving this problem. The most efficient solution is to just find the difference between the sum of all integers from 1 to 100 and the sum of all integers in the array. This algorithm has a running complexity of  O (n)  and a space complexity of  O (1)  since it just needs 2 variables to store the sums . Here is the code for this -   /**      * This will find the missing integer in the given array of size 99.      *      * The array has integers between 1 and 100 with one integer      * missing.      *      * @param array - Array of integers b/w 1 and 100 of size 99.      * @return int - the missing integer number.      */     public static int findMissingInteger(int[] array)     {         int sum = 0;          // This has the complexity of O (n)         for (int i = 0; i         {             sum...
Post a Comment
Read more