Guest Session: 1 Question Remaining.
Create Account
to save progress.
Login
Recursion
hard
0:00.0
The depth of recursion for a Merge Sort on an array of size
n
=
16
n=16
n
=
16
is:
A
8
8
8
B
16
16
16
C
5
5
5
D
4
4
4
Submit Answer