Skip to content
free
K
1
2
practice
Home
Math
English
Science
Social Studies
Contact
Language
English
Español
Sign In
/
High School Electives
/
Computer Science
/
Stable and In-Place Sorting Concepts
Grade Level
Computer Science
HSCS.166 Stable and In-Place Sorting Concepts
0%
Skill Level
🔴 Hard
00:00
Progress to Next Level
25% to Medium
Easy
Medium
Hard
Mastery
100%
A system cannot allocate an auxiliary array proportional to n, but it must keep equal-key records in order. Which note should appear in the design review?
A
Choose or implement a stable in-place method, and verify it with duplicate-key test cases.
B
Ignore stability because memory limits make tie order impossible.
C
Use standard heap sort because it always preserves equal keys.
D
Use standard array merge sort because its auxiliary array is not proportional to n.
Submit Answer
