Pollard’s Rho Algorithm for Prime Factorization in java

It is an algorithm to perform factorization on given integers. Following is the program implementing the Rho Algorithm for Prime Factorization.

Program

Live Demo

public class PollardsRho {
   int num = 65;
   public int gcd(int a, int b) {
      int gcd = 0;
      for(int i = 1; i <= a || i <= b; i++) {
         if( a%i == 0 &amp;&amp; b%i == 0 ) {
            gcd = i;
         }
      }
      return gcd;
   }
   int g(int x) {
      return ((x*x)-1) % num;
   }
   public static void main(String args[]) {
      PollardsRho obj = new PollardsRho();
      int x = 2, y = 2, d = 1;
      while(d==1) {
         x = obj.g(x);
         y = obj.g(obj.g(y));
         d = obj.gcd((x - y), obj.num);
      }
      if (d == obj.num) {
         System.out.println("Cannot calculate GCD for this element");
      } else {
         System.out.println("One of the divisors of given number is "+d);
      }
   }
}

Output

One of the divisors of given number are 5

Ankith Reddy

Published on 07-Jun-2018 07:23:11

• Related Questions & Answers
• Fleury’s Algorithm
• kasai’s Algorithm
• Manacher’s Algorithm
• Dijkstra’s Algorithm for Adjacency List Representation
• Stein’s Algorithm for finding GCD in C++
• C++ Program for Dijkstra’s shortest path algorithm?
• Difference Between Prim’s and Kruskal’s Algorithm
• Dijkstra’s Shortest Path Algorithm
• Berkeley’s Algorithm in C/C++
• Kruskal’s Minimum Spanning Tree Algorithm
• Prim’s Minimum Spanning Tree Algorithm
• Prime Factorization using Sieve O(log n) for multiple queries in C++
• Fleury’s Algorithm for printing Eulerian Path or Circuit in C++
• Prim’s Algorithm (Simple Implementation for Adjacency Matrix Representation) in C++
• C++ Program to Implement Kadane’s Algorithm