grokking-algorithms/chapter2/README.md
2024-02-06 21:53:17 +00:00

252 B
Raw Blame History

Selection Sort

We have to perform N swaps a total of N times. This takes N^N steps, therefore:

This algorithm has time complexity O(N^2)

Technically (n 1, n - 2 ... 2, 1 ~= N/2) swaps are performed but in BigO the constants are dropped.