Sorting Algorithm and Complexity

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Sorting Algorithm and Complexity. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

At Impossible Foods, product event streams often need deterministic ordering before downstream processing. Implement a sorting algorithm of your choice in Python, and return the sorted array.

Choose a standard comparison-based sort such as merge sort, quicksort, or heap sort. Your solution must sort the input in ascending order and handle duplicate values and negative numbers.

Formal Specification

Write a function that takes one parameter:

nums: a list of integers

Return:

A new list containing the same integers in ascending order

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
The output must be a new sorted list
Do not use built-in sorting helpers such as sort() or sorted()

Function Signature

def sort_numbers(nums):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output