Find the Largest Prime Factor in Java

In this post, I will share code snippet that will find the largest prime factor from a given number in Java.

Introduction 

 

The code snippet in this blog is an example of how to find the largest prime factor from a given number in Java. 

package largestprimefactor.FreeSampleProjects.com;
import java.util.Scanner;
public class LargestPrimeFactor {
 public static void main(String[] args) {
  Scanner input = new Scanner(System.in);
  System.out.println("Enter a number?");
  int number = input.nextInt();
  int result = largestPrimeFactor(number);
  System.out.println("The result is " + result);
 }
 public static int largestPrimeFactor(int n) {
  if (n <= 1) {
   return 0;
  } else {
   int div = 2;
   while (div < n) {
    if (n % div != 0) {
     div++;
    } else {
     n = n / div;
     div = 2;
    }
   }
   return n;
  }
 }
}