Lecture 14 Pre-Class

1. (5 pts.) Research an algorithm for finding prime factors of a number (i.e. a number z, its prime factors are two prime numbers x and y such that xy = z). Implement a prime factoring algorithm (either from scratch or using a library) and comment on how it works.
2. (5 pts.) Test the performance of the algorithm when the prime factors are one digit long. Compare this to the performance when the prime factors are 2 digits long, 3 digits long, 4 digits long, and 5 digits long.