Start learning →

An algorithm that repeatedly picks the option with the best immediate benefit is:

AGuarded
BGrouped
CGuided
DGreedy
Answer & Solution
Correct answer: D. Greedy
1. It never looks ahead to future consequences. 2. It takes the best choice available now. 3. That approach is greedy. _Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Practise this question with Quill — Coding Interview Prep →

Keep practising Data Structures and Algorithms

Browse all Data Structures and Algorithms questions for Coding Interview Prep, or explore more Computer Science topics.

Start a Data Structures and Algorithms lesson →
Related questions
Algorithms bingoType the numberSort the computing ideasArray or linkedSlice the structuresRun the algorithm gatesPop the growth classesCatch the data structures