Ad
  • Custom User Avatar

    I tried to check if n is a prime number when each time n changes. Hope this can help.

  • Custom User Avatar

    This implementation takes too long when n is big and can only be factorized like (2)(n') where n' is half of n(which is a big prime number).
    for example, it takes a long long time to find the primeFactors(76587634333).

    My implementation checkes if n is a prime number after each time n changes and it works well for all cases, although it seems long.

    Hope the idea of 'checking if n is a prime number' would help you improve your algorithm.