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
/
Merge Sort
Grade Level
Computer Science
HSCS.160 Merge Sort
0%
Skill Level
🔴 Hard
00:00
Progress to Next Level
25% to Medium
Easy
Medium
Hard
Mastery
100%
Why is merge sort often efficient for linked lists?
A
It only works for linked lists with exactly two nodes
B
It sorts linked lists by converting values to images
C
It needs constant-time random access to every node index
D
It can merge sorted chains by changing next pointers without shifting array elements
Submit Answer