mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-11-15 17:30:52 +00:00
8 lines
252 B
Markdown
8 lines
252 B
Markdown
|
# 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.
|