Sign inSign in
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.
as David J. Malan defines itHarvard UniversityThe wording closest to all 3 definitions
Watch it explained

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.

Array2Loop2Indices1List1Sorting algorithms1Swapping1Swapping elements1Swapping variables1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ana Bell

    MIT · Introductory

    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

    UC Berkeley · Undergraduate

    A simple sorting algorithm that repeatedly finds the smallest item from the unsorted part and puts it at the front.
    • 18:54CS61B Lecture 6: Testing

Connections

9

The lectures that define it or assume it, and the concepts next to it.

Concepts6

Lectures3

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.