Practice Quiz

FSOT Pro

Category - Computers

Start a Study Session Sign up for Question of the Day
Which of the following algorithms is the least complex?
  1. Dynamic programming
  2. The greedy method
  3. Search and enumeration
  4. Exhaustive search
Explanation
Answer: D - The exhaustive search is the least complex of these algorithms. Also known as the brute-force method, an exhaustive search simply tries all possible answers and checks to see which one works. Many problems cannot be solved by this method because it would take too long. To factor very long primes in this way, for example, would take longer than the current age of the universe.
Was this helpful? Upvote!
Login to contribute your own answer or details
Start a Study Session Sign up for Question of the Day

Top questions

Related questions

Most popular on PracticeQuiz