onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity
ab09aa5269
grokking-algorithms/chapter2
History
onyx-and-iris 3fe14b8ac0 clean up repo. 
add more notes
2024-02-06 21:53:17 +00:00
..
README.md clean up repo. 2024-02-06 21:53:17 +00:00
selectionsort.py rename file, no changes to content 2024-01-08 10:46:30 +00:00

README.md

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.