Implement O(n) sort for inverted selection

jarun / nnn

n³ The unorthodox terminal file manager

BSD 2-Clause "Simplified" License

19.4k stars 763 forks source link

Closed jarkkojs closed 5 months ago

jarkkojs commented 5 months ago

No legit reason to waste O(n*log(n)) time in this situation.