Skip to content
UPEEC

Selection Sort

Repeatedly select the smallest remaining element and swap it into place — $O(n^2)$, few swaps.

Beginner
Comments 0

Minimises writes, which matters on flash memory.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.