An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________
(a) Brute Force
(b) Divide and Conquer
(c) Dynamic programming algorithms
(d) None of the mentioned
I had been asked this question in class test.
The question is from Algorithms topic in chapter Algorithms of Discrete Mathematics