A route-planning algorithm for autonomous delivery drones initially uses a brute-force approach to evaluate all possible routes. Which outcome occurs when the number of delivery locations increases substantially?

💡 Explanation

As the number of delivery locations grows, the number of possible routes increases factorially. The brute-force algorithm's runtime therefore grows factorially with the number of locations, because it must examine every possible route. Rather than memory decreasing or time decreasing, the computational cost explodes.

• Within the context of RSA cryptography, which outcome arises when assuming a number, 'n', can be factored efficiently despite its selection following established prime number generation protocols?
• A digital circuit design, represented as a CNF formula, contains a clause (A ∨ ¬A). If using a SAT solver, which consequence follows?
• When implementing a recursive flood fill algorithm on a pixel grid, which behavior correctly applies the inductive step?
• If a chemical plant uses a formal logic system to verify the safety of its control procedures, which consequence follows if the axioms of the system are inconsistent?
• If a cryptographic key generation algorithm relies heavily on multiplying very large prime numbers, which security risk increases most if the primes are too close in magnitude?
• If a large dataset of product reviews is sorted alphabetically using the merge sort algorithm, which computational complexity characterizes its average-case time performance?