Algorithm to find Largest prime factor of a number

Question

What is the best approach to calculating the largest prime factor of a number?

I'm thinking the most efficient would be the following:

1. Find lowest prime number that divides cleanly
2. Check if result of division is prime
3. If not, find next lowest
4. Go to 2.

I'm basing this assumption on it being easier to calculate the small prime factors. Is this about right? What other approaches should I look into?

Edit: I've now realised that my approach is futile if there are more than 2 prime factors in play, since step 2 fails when the result is a product of two other primes, therefore a recursive algorithm is needed.

Edit again: And now I've realised that this does still work, because the last found prime number has to be the highest one, therefore any further testing of the non-prime result from step 2 would result in a smaller prime.

Answer 1

Here's the best algorithm I know of (in Python)

def prime_factors(n):     """Returns all the prime factors of a positive integer"""     factors = []     d = 2     while n > 1:         while n % d == 0:             factors.append(d)             n /= d         d = d + 1      return factors   pfs = prime_factors(1000) largest_prime_factor = max(pfs) # The largest element in the prime factor list 

The above method runs in O(n) in the worst case (when the input is a prime number).

EDIT:
Below is the O(sqrt(n)) version, as suggested in the comment. Here is the code, once more.

def prime_factors(n):     """Returns all the prime factors of a positive integer"""     factors = []     d = 2     while n > 1:         while n % d == 0:             factors.append(d)             n /= d         d = d + 1         if d*d > n:             if n > 1: factors.append(n)             break     return factors   pfs = prime_factors(1000) largest_prime_factor = max(pfs) # The largest element in the prime factor list