Fast sorting, branchless by design

Weird to see a post about sorting that claims that quicksort is O(n log n), without apparently mentioning anything about randomization/average (the intro suggests that a deterministic quicksort is being considered?).

It's amusing that the way to get maximum performance out of modern CPUs is to program them like GPUs.