ConceptSystems & CS
Selection sort
An algorithm that repeatedly scans the unsorted portion of a list to find the smallest element and swaps it into its correct sorted position from left to right.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Ana Bell
A sorting algorithm that divides the input list into two parts: a sorted sublist of items built up from left to right at the front and an unsorted sublist occupying the rest of the list.Josh Hug
A simple sorting algorithm that repeatedly finds the smallest item from the unsorted part and puts it at the front.
Connections
9The lectures that define it or assume it, and the concepts next to it.