Algorithms

In computer science, Selection sort refers to which of the following?

Difficulty: Easy

• A. An algorithm that uses a degree of randomness as part of its logic to achieve good average-case performance.

  Why not A: “An algorithm that uses a degree of randomness as part of its logic to achieve good average-case performance.” is not correct. The accepted answer is C. A sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.

• B. An optimization technique that stores the results of expensive function calls to avoid recomputing them.

  Why not B: “An optimization technique that stores the results of expensive function calls to avoid recomputing them.” is not correct. The accepted answer is C. A sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.

• 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.

  Why not D: “A greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight.” is not correct. The accepted answer is C. A sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.

Source: Algorithms Official Reference Guide

Tags: computer science, algorithms, problem solving, complexity analysis

Submitted by: MCQsHub Editorial

More Algorithms MCQs