Perm Sort
Term side of the Card
Topic: Inefficient Sorting Algorithms
Unit title: Perm Sort
Categories: Algorithm, Concept
Explanation side of the Card
Explanation: The highly inefficient sorting algorithm that checks each possible permutation of a list until it finds a sorted one. Theoretical worst-case complexity is factorial, O(n!).