Selection Sort Implementation | Dataford Interview Questions

How would you implement a selection sort algorithm?

Implement selection_sort(nums) to sort the input list of integers in ascending order. The algorithm must sort the list in place and return the sorted list. Do not call Python's built-in sorting functions.

Function: def selection_sort(nums):
Input: A list of integers. Output: The same list, sorted in ascending order.

Constraints

0 <= nums.length <= 500
-10^9 <= nums[i] <= 10^9
The list must be sorted in place
Do not use built-in sorting functions

Function Signature

def selection_sort(nums):

Your question is Selection Sort Implementation. 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

How would you implement a selection sort algorithm?

Function: def selection_sort(nums):
Input: A list of integers. Output: The same list, sorted in ascending order.

Constraints

0 <= nums.length <= 500
-10^9 <= nums[i] <= 10^9
The list must be sorted in place
Do not use built-in sorting functions

Function Signature

def selection_sort(nums):

Your question is Selection Sort Implementation. 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.