Sorting From Scratch | Dataford Interview Questions

Can you implement a sorting algorithm for a list from scratch?

Implement sort_list(nums) to return the numbers in nondecreasing order without using sorted() or .sort(). The function must return a new list and leave the input list unchanged. Any comparison-based sorting algorithm is acceptable, but explain its time and space complexity.

Constraints

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

Function Signature

def sort_list(nums):

Your question is Sorting From Scratch. 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

Can you implement a sorting algorithm for a list from scratch?

Constraints

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

Function Signature

def sort_list(nums):

Your question is Sorting From Scratch. 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.