Complexity Analysis for ML Code | Dataford Interview Questions

Explain the time and space complexity of your solution for a standard sorting or searching problem.

Implement merge_sort(nums) to return the values in ascending order without modifying the input list. The input is a list of integers, and the output is a new sorted list.

Constraints

0 <= len(nums) <= 10^5
Values in nums are integers
The input list must not be modified

Function Signature

def merge_sort(nums):

Your question is Complexity Analysis for ML Code. 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

Explain the time and space complexity of your solution for a standard sorting or searching problem.

Implement merge_sort(nums) to return the values in ascending order without modifying the input list. The input is a list of integers, and the output is a new sorted list.

Constraints

0 <= len(nums) <= 10^5
Values in nums are integers
The input list must not be modified

Function Signature

def merge_sort(nums):

Your question is Complexity Analysis for ML Code. 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.