Problem
1. Write a probabilistic algorithm that factors any integer using the functions prime and factor. Function prime is a Boolean function that returns "true" if a given integer is a prime number and returns "false" if it is not. Function factor is a function that returns a nontrivial factor of a given composite integer. Analyze your algorithm, and show the results using order notation.
2. List the advantages and disadvantages of all the searching algorithms discussed in this chapter.
3. For each of the searching algorithms discussed in this chapter, give at least two examples of situations in which the algorithm is the most appropriate.