Implement Merge Sort

Implement merge sort. Given an integer array arr of length n, output the array sorted in ascending order.

Requirements:

  • Use the merge sort paradigm (divide-and-conquer + merge).
  • You may use `...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: