onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-04-01 19:23:52 +01:00
Code Issues Packages Projects Releases Wiki Activity
grokking-algorithms/chapter_02/README.md
onyx-and-iris 4cd7bb7d18 reorganise directories 
upd chapter_01/binary.py
2025-03-26 01:27:35 +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.