issues
search
jarun
/
nnn
n³ The unorthodox terminal file manager
BSD 2-Clause "Simplified" License
19.1k
stars
760
forks
source link
Implement O(n) sort for inverted selection
#1903
Closed
jarkkojs
closed
3 months ago
jarkkojs
commented
3 months ago
No legit reason to waste O(n*log(n)) time in this situation.
No legit reason to waste O(n*log(n)) time in this situation.