Y
Hacker News
new
|
ask
|
show
|
jobs
by
hdjfjkremmr
237 days ago
it's sorting 50 times a list going from 50 to 0 items.
1 comments
blharr
236 days 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
link
hyperhello
236 days ago
There 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.
link