onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2026-04-16 11:33:34 +00:00
Code Issues Packages Projects Releases Wiki Activity

clean up repo.

Browse Source 
add more notes
This commit is contained in:
onyx-and-iris
2024-02-06 21:53:17 +00:00
parent d552050f7e
commit 3fe14b8ac0
13 changed files with 52 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
chapter2/README.md Normal file
View File

@@ -0,0 +1,7 @@
# 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.