Implement a Sorting Algorithm | Dataford Interview Questions

How would you implement a specific sorting algorithm?

Implement merge sort for an array of integers without using sort() or sorted(). Return a new array containing the same values in nondecreasing order. The input may be empty, and the implementation should preserve the relative order of equal values.

Constraints

0 <= nums.length <= 100
-10^9 <= nums[i] <= 10^9
Do not use sort() or sorted()
Return a new array and do not modify nums

Function Signature

def merge_sort(nums):

Your question is Implement a Sorting Algorithm. 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

How would you implement a specific sorting algorithm?

Constraints

0 <= nums.length <= 100
-10^9 <= nums[i] <= 10^9
Do not use sort() or sorted()
Return a new array and do not modify nums

Function Signature

def merge_sort(nums):

Your question is Implement a Sorting Algorithm. 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.