Sorting an Array of Integers | Dataford Interview Questions

Write a program to sort an array of integers.

Implement sort_integers(nums) to return the values in ascending order without relying on Python's built-in sorting function. The function receives a list of integers and returns a new sorted list, for example [3, 1, 2] becomes [1, 2, 3] and [4, -1, 4] becomes [-1, 4, 4]. Constraints: 0 <= len(nums) <= 1,000, and values range from -10^9 to 10^9.

Constraints

0 <= len(nums) <= 1,000
-10^9 <= nums[i] <= 10^9
Return the values in nondecreasing order
Do not use Python's built-in sorting function

Function Signature

def sort_integers(nums):

Your question is Sorting an Array of Integers. 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

Write a program to sort an array of integers.

Constraints

0 <= len(nums) <= 1,000
-10^9 <= nums[i] <= 10^9
Return the values in nondecreasing order
Do not use Python's built-in sorting function

Function Signature

def sort_integers(nums):

Your question is Sorting an Array of Integers. 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.