Order an Integer Array | Dataford Interview Questions

Given an array of integers, how would you sort it? Implement sort_integers(nums) to return a new array containing the same integers in nondecreasing order, without modifying nums. Use an algorithm with O(n log n) worst-case time complexity and explain the time and space trade-offs. For example, [5, 2, 9, 1] becomes [1, 2, 5, 9], while an empty array remains empty.

Constraints

0 <= nums.length <= 10000
-10^9 <= nums[i] <= 10^9
Return a new array and do not modify nums
The output must be sorted in nondecreasing order

Function Signature

def sort_integers(nums):

Your question is Order an Integer Array. 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

Constraints

0 <= nums.length <= 10000
-10^9 <= nums[i] <= 10^9
Return a new array and do not modify nums
The output must be sorted in nondecreasing order

Function Signature

def sort_integers(nums):

Your question is Order an Integer Array. 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.