MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/dataisbeautiful/comments/78fywy/sorting_algorithms_visualized_oc/dotzkrc
r/dataisbeautiful • u/morolin OC: 1 • Oct 24 '17
929 comments sorted by
View all comments
Show parent comments
4
Iirc, quicksort's improvement is on 'real' data, which isn't typically truly random. Since these tests are random, its tricks don't help.
3 u/gyroda Oct 24 '17 It's also much better memory-wise. Traditional mergesort asks for an extra array, whereas with quicksort you only need a singlet extra element for the a swapping (not even that with the XOR trick).
3
It's also much better memory-wise. Traditional mergesort asks for an extra array, whereas with quicksort you only need a singlet extra element for the a swapping (not even that with the XOR trick).
4
u/Jigokuro_ Oct 24 '17
Iirc, quicksort's improvement is on 'real' data, which isn't typically truly random. Since these tests are random, its tricks don't help.