The array-based implementation for Mergesort uses how many arrays?

2
  • 1
  • n
  • \log n

There are \log n passes.

But the implementation is careful to reuse the auxilliary array rather than make a new one on each pass.

So Mergesort requires the original array and an auxilliary array.