Selection sort algorithm design technique is an example of
- A. Greedy method
- B. Divide and conquer
- C. Dynamic Programming
- D. Backtracking
Answer: A. Greedy method
Explanation: It greedily selects the minimum element in each pass.
All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2007
Selection sort algorithm design technique is an example of
Answer: A. Greedy method
Explanation: It greedily selects the minimum element in each pass.
Previous question | Next question | All questions of ISRO Computer Science (CSE) 2007