Which of these algorithmic approaches tries to achieve localized optimum solution?
A. Greedy approach
B. Divide and conquer approach
C. Dynamic approach
D. All of the above
Answer:A
Which of these algorithmic approaches tries to achieve localized optimum solution?
A. Greedy approach B. Divide and conquer approach C. Dynamic approach D. All of the above