Skip to content
IGCSE
Find course
Features
Open app
IGCSE
Computer Science Edexcel
Question bank
Algorithms
Easy
Medium
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
Question 14
Calculator
Highlight
Mark as complete
Markscheme
Explain
one
reason why an insertion sort algorithm is highly efficient in terms of its memory usage.
[2]
Write your answer here...
Markscheme
Ask Genie
3
Grade answer
Ask me anything!
Algorithms Questions
IGCSE
/
Computer Science
/
Algorithms