Speedup Rust’s heapsort by 1.5x by making it branchless

slice::sort_unstable will fall back to heapsort if it repeatedly fails to find a good pivot. By making the core child update code branchless it is much faster. On Zen3 sorting 10k u64 and forcing t… Read more

Similar