Implement Sorting Algorithm | Dataford Interview Questions

Implement a sorting algorithm.

Asked in the Technical interview stage. Implement sort_numbers(nums) using a comparison-based algorithm without calling the built-in sorting functions.

Input and Output

nums is a list of integers. Return a new list containing the same values in nondecreasing order. Do not modify the input list.

Constraints

0 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
Return a new list and do not modify nums
Do not call the built-in sorting functions
Target O(n log n) time complexity

Function Signature

def sort_numbers(nums):

Your question is Implement 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