ITPEC FE Subject A October 2024 Question 7
ITPEC FE Subject A October 2024 — Question 7 of 60
Selection Sort — identify the correct description of the algorithm.
Selection sort works by repeatedly finding the extreme value (largest or smallest) from the unsorted portion and placing it in its final position.
Why not others:
- (a) Quick Sort — picks a pivot, partitions into "larger" and "smaller" groups, recurses
- (b) Shell Sort — sorts elements at regular intervals, shrinking the interval down to 1
- (d) Bubble Sort — repeatedly compares and swaps adjacent elements
Key rule: Selection sort = "select the min/max, place it, repeat." The word selection = choosing the extreme element each pass.
AI-generated — may contain errors
The original exam layout is preserved in the image so diagrams, formulas, tables, and code remain accurate.
This question comes from an official ITPEC past paper. ITPEC Practice is an independent study tool and is not affiliated with ITPEC. See the official FE past-paper collection or Report an issue.