An insertion sort is one type of sorting algorithm.

A student has written a pseudocode algorithm to perform an insertion sort on a 1D array of strings cities.

cities = ["Tokyo", "Paris", "Cairo", "Berlin", "Sydney"]
for count = 1 to cities.length - 1
    idx = count
    while (idx > 0 and cities[idx] < cities[idx - 1])
        temp = cities[idx]
        cities[idx] = cities[idx - 1]
        cities[idx - 1] = temp
        idx = idx - 1
    endwhile
next count

An insertion sort contains nested loops. In this pseudocode algorithm, the outer loop is a count-controlled loop and the inner loop is a condition-controlled loop.