Implement Merge Sort in Python | Dataford Interview Questions

How would you solve a sorting algorithm problem within a live coding time constraint?

Implement merge_sort(nums) to return the input integers in nondecreasing order. Use a comparison-based algorithm rather than the built-in sorting function. The function should return a new list and leave nums unchanged.

Input: a list of integers. Output: a sorted list of integers.

Constraints

0 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
Do not use the built-in sorted function or list.sort method
The input list must not be modified

Function Signature

def merge_sort(nums):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

Problem

How would you solve a sorting algorithm problem within a live coding time constraint?

Input: a list of integers. Output: a sorted list of integers.

Constraints

0 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
Do not use the built-in sorted function or list.sort method
The input list must not be modified

Function Signature

def merge_sort(nums):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.