Implement an Algorithm Function | Dataford Interview Questions

Write a function to implement a specific algorithm (e.g., sorting, searching). Implement a stable merge sort that returns the input integers in ascending order without calling Python's built-in sorting functions. The function must return a new list and leave the input list unchanged. Input: a list of integers. Output: a new sorted list containing the same values.

Example: nums = [5, 2, 4, 1] produces [1, 2, 4, 5]. An empty list produces an empty list.

Constraints: 0 <= len(nums) <= 1,000, and each integer is between -10^9 and 10^9.

Constraints

0 <= len(nums) <= 1,000
-10^9 <= nums[i] <= 10^9
Do not call sorted() or list.sort()
Return a new list and leave nums unchanged

Function Signature

def merge_sort(nums):

Your question is Implement an Algorithm Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Example: nums = [5, 2, 4, 1] produces [1, 2, 4, 5]. An empty list produces an empty list.

Constraints: 0 <= len(nums) <= 1,000, and each integer is between -10^9 and 10^9.

Constraints

0 <= len(nums) <= 1,000
-10^9 <= nums[i] <= 10^9
Do not call sorted() or list.sort()
Return a new list and leave nums unchanged

Function Signature

def merge_sort(nums):

Your question is Implement an Algorithm Function. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.