An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is ___
Posted: Thu Jul 14, 2022 9:01 am
a) Brute Force
b) Divide and Conquer
c) Dynamic programming algorithms
d) None of the mentioned
b) Divide and Conquer
c) Dynamic programming algorithms
d) None of the mentioned