Ononot — Find the depth of recursion for a Merge Sort algorithm on an

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionhard

0:00.0

Find the depth of recursion for a Merge Sort algorithm on an array of size $n=16$ .