ConceptSystems & CS
Bogo sort
A highly inefficient sorting algorithm that repeatedly shuffles a list at random until it happens to be sorted.
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.
List sorting1Randomness1
Lecturers
1Connections
1The lectures that define it or assume it, and the concepts next to it.