Custom Sort and Complexity | Dataford Interview Questions

Implement a custom sorting algorithm and explain its time complexity without using standard library shortcuts.

Write sort_numbers(nums) to return a new list containing the integers in nondecreasing order. Do not call sorted, .sort, or any library sorting routine. Your solution should correctly handle duplicates, negative values, an empty list, and a single-element list. State the algorithm's time and auxiliary-space complexity.

Constraints

0 <= len(nums) <= 500
-10^9 <= nums[i] <= 10^9
Return a new list and do not modify nums
Do not use sorted, list.sort, or any library sorting routine

Function Signature

def sort_numbers(nums):

Your question is Custom Sort and 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

Implement a custom sorting algorithm and explain its time complexity without using standard library shortcuts.

Constraints

0 <= len(nums) <= 500
-10^9 <= nums[i] <= 10^9
Return a new list and do not modify nums
Do not use sorted, list.sort, or any library sorting routine

Function Signature

def sort_numbers(nums):

Your question is Custom Sort and 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.