The Insertion Sort algorithm orders a one-dimensional array of n data items into ascending order or descending order. An outer loop makes n -1 passes over the array.