ASL STEM

Definition

is an sorting algorithm that repeatedly finds the smallest unprocessed element of the array and moves it to the frontmost remaining slot of the array. To clarify, the algorithm makes many passes over an input array to put its elements into sorted order. Each time through a loop, the smallest value is selected and put in the proper place near the front of the array.

Source: Reges & Stepp, 2007

Example

Example sentence for context: "Selection sort is a well-known sorting algorithm that makes many passes over an input array to put its element into sorted order."