Your question is Implement Merge Sort Array. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Sort an integer array in non-decreasing order by implementing merge sort yourself. Return a new sorted array and do not use built-in sorting functions.
1 <= len(nums) <= 10^5-10^9 <= nums[i] <= 10^9sorted() or list.sort()