Sorting is one of the most studied problems in computer science. Every language ships a built-in sort, and for most applications, picking the right one ...

Lobsters is a community-driven platform for sharing and discussing links to articles, tutorials, and projects related to technology and programming. Readers can learn about a wide range of topics, from software development and system administration to cybersecurity and artificial intelligence. With user submissions, comments, and voting, Lobsters provides a platform for collaborative learning and knowledge sharing among technology enthusiasts.

Lobsters

Sorting networks provide constant-time sorting by using a fixed comparison schedule independent of input data, eliminating timing side-channel vulnerabilities critical for cryptographic applications. Batcher's bitonic sort achieves O(n log²n) complexity with data-oblivious execution, while djbsort implements this using SIMD vectorization to achieve 2-5x speedups over standard library sorts. The article details implementation techniques including branchless compare-and-swap operations, float-to-integer key transforms, and architecture-specific optimizations in a Zig implementation that outperforms pdqsort across most practical array sizes.

Fast sorting, branchless by design