DAY 90 OF 90 · The loops under DSA

Sort it yourself

Medium90 Days of Looping

Inputs

values is a list of 0 to 12 whole numbers, each from -20 to 20.

Your tasks

Create a copy result of values.
Use an outer loop for each position i from 1 up. Hold result[i] as held, then use an inner while loop to shift bigger numbers to the right, one position, until you find the place for held. Put held in that place.
Complete insertionSort so it returns result, the numbers in increasing order. Return it, do not print it.

Example

With values = [5, 2, 9, 1, 5, 6], insertionSort returns [1, 2, 5, 5, 6, 9].

Rules

Do not use a built-in sort.
Do not change values.

Test data

TEST DATA 1: values is [5, 2, 9, 1, 5, 6]

TEST DATA 2: values is []

Practice focus

Prefix sums, counting, binary search, best stretch and sorting, all written as plain loops. This is where loops turn into named algorithms. You have already written the loops.

Day 89 All 90 days