Question: 6. Consider the following brute-force algorithm for solving the composite num ber problem: Check successive integers from 2 to ln/2] as possible divisors of n.

 6. Consider the following brute-force algorithm for solving the composite num

6. Consider the following brute-force algorithm for solving the composite num ber problem: Check successive integers from 2 to ln/2] as possible divisors of n. If one of them divides n evenly, return yes (i.e., the number is composite); if none of them does, return no. Why does this algorithm not put the problem in class P

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!