Sort Large Dataset Efficiently | Dataford Interview Questions

Implement an algorithm to sort a large dataset efficiently.

Implement sort_large_dataset(data), which accepts a list of comparable integers and returns a new list containing the same values in nondecreasing order. Do not modify the input list or call Python's built-in sorting functions. For example, [5, 1, 3] returns [1, 3, 5], while [2, 2, -1] returns [-1, 2, 2]. The input may contain up to 100,000 integers, including duplicates and negative values.

Constraints

0 <= len(data) <= 100000
Each element is a comparable integer
The input list must not be modified
Return a new list containing exactly the input values in nondecreasing order
Do not call built-in sorting functions

Function Signature

def sort_large_dataset(data):

Your question is Sort Large Dataset Efficiently. 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 an algorithm to sort a large dataset efficiently.

Constraints

0 <= len(data) <= 100000
Each element is a comparable integer
The input list must not be modified
Return a new list containing exactly the input values in nondecreasing order
Do not call built-in sorting functions

Function Signature

def sort_large_dataset(data):

Your question is Sort Large Dataset Efficiently. 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.