Selection Sort
← Back to Comparison-Based
Finds the minimum element from the unsorted portion and places it at the beginning. O(n^2) time complexity but makes the minimum number of swaps, which can be advantageous when writes are expensive.
← Back to Comparison-Based
Finds the minimum element from the unsorted portion and places it at the beginning. O(n^2) time complexity but makes the minimum number of swaps, which can be advantageous when writes are expensive.