In computer science, Selection sort refers to which of the following?
- A. An algorithm that uses a degree of randomness as part of its logic to achieve good average-case performance.
- B. An optimization technique that stores the results of expensive function calls to avoid recomputing them.
- C. A sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position. ✓
- D. A greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight.
Correct answer
C. A sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.
Explanation
Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.