What term describes the following? a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.
Difficulty: Easy
About this MCQ
This Easy Algorithms MCQ checks one syllabus fact.
The question is: “What term describes the following? a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.”
The accepted answer is B. Selection sort. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.
- A. Linear search
Why not A: “Linear search” is not correct. The accepted answer is B. Selection sort. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.
- B. Selection sort ✓
- C. Heap sort
Why not C: “Heap sort” is not correct. The accepted answer is B. Selection sort. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.
- D. Brute-force algorithm
Why not D: “Brute-force algorithm” is not correct. The accepted answer is B. Selection sort. Selection sort refers to a sorting algorithm that repeatedly selects the smallest remaining element and moves it to its correct position.
Correct answer
B. Selection sort
Explanation
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
Related MCQs
- Which concept is defined as follows: a search algorithm that checks each element in a list sequentially until...
- What is Linear search primarily used for?
- The following statement describes a specific concept. What is it called? a measure of the amount of memory an...
- Select the accurate description of Space complexity.
- Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even wi...
- What does Bellman-Ford algorithm refer to?