3 ms·
49 of those times, it's hitting the best case of sorting an already sorted list, so I still can't imagine that huge of a performance penalty
by blharr 1y ago
49 of those times, it's hitting the best case of sorting an already sorted list, so I still can't imagine that huge of a performance penalty
- hyperhello 1y agoThere are sort algorithms that don’t do any work except scanning if the list is unsorted, but there are more efficient ones to use if they are.