This code finds the largest prime factor of a given long called "dividend". It starts by dividing "dividend" by dividen/2. If the number is a factor, then it checks if it is prime. Once it finds a prime number it should stop the execution, but the code continues.
Please advise, thanks.