An algorithm that always takes the best immediate or local-02228
An algorithm that always takes the best immediate or local solution while finding an answer is called __________
This multiple choice question (MCQ) is related to the book/course
vu cs101 Introduction to Computing.
It can also be found in
vu cs101 Mid Term - Quiz No.13.
An algorithm that always takes the best immediate or local solution while finding an answer is called __________
Deterministic Algorithm
Non deterministic Algorithm
Greedy Algorithm
Randomized Algorithm
