Example 3 : Merge Sort
| Topic | Difficulty | Companies |
|---|---|---|
| Recursion and Divide & Conquer Approach | HARD | Google Amazon Intel |
Given an array of integers arr[], Write a program to sort the array in ascending order using Merge Sort.
Example 1
Input: arr[] = [5, 2, 3, 1]
Output: [1, 2, 3, 5]
Example 2
Input: arr[] = [5, 1, 1, 2, 0, 0]
Output: [0, 0, 1, 1, 2, 5]