Sort With Time Complexity | Dataford Interview Questions

Write a function to sort an array of integers with a specific time complexity.

Implement sort_integers(nums) so it returns the integers in nondecreasing order using O(n log n) time. Do not call Python's built-in sorting functions.

Input: A list of integers.

Output: A new list containing the same integers in sorted order.

Example 1: nums = [5, 2, 8, 1] returns [1, 2, 5, 8].

Example 2: nums = [3, 3, -1, 0] returns [-1, 0, 3, 3].

Constraints

0 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
Return a new list and do not call built-in sorting functions
The algorithm must run in O(n log n) time

Function Signature

def sort_integers(nums):

Your question is Sort With Time Complexity. 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