lorenzhs/quicksort-pivot-imbalance
View on GitHub ↗ ★ 8 Gnuplot
Fun with branch (mis-)prediction
4 mentions on Hacker News by 2 people: 1 story, 3 comments · first 2015-05-08 · latest 2018-08-31
20082026
-
…like 10–15 cycles). Shameless plug for something I once built for a lecture to demonstrate this: https://github.com/lorenzhs/quicksort-pivot-imbalance For sorting algorithms that take the behaviour of modern CPUs into account, check out…
comment by lorenzhs · 2018-08-31 · in On the Worst-Case Complexity of TimSort -
…I implemented quicksort with intentionally skewed pivot selection. You can see the results here: https://github.com/lorenzhs/quicksort-pivot-imbalance For this demo I'm sorting a permutation of the range 1 to n, so obtaining perfect or…
comment by lorenzhs · 2017-06-30 · in Pattern-defeating quicksort -
…sample sort in a totally artificial setting (sorting a permutation of 0 to n-1) for a lecture: https://github.com/lorenzhs/quicksort-pivot-imbalance (Repository does not contain the super scalar sample sort code, I don't have the rights to…
comment by lorenzhs · 2015-05-08 · in Memory Layouts for Binary Search