sorting

This paper presents Radsort, a parallel LSD radix sort algorithm with O(sqrt(n)) overhead that is stable, easy to implement, and outperforms conventional methods for large arrays.

Nous Portal has been updated with a reworked model catalog page, consolidating active free models, promotions, and a sortable list of all available models in one place.

A technical blog post that explores sorting, hashing, and sketching algorithms on a dataset of 370,103 English words, measuring time and memory costs, with a focus on practical implementations like binary search, quicksort, and HyperLogLog.

Introduces a tool that provides live visualizations and code for learning algorithms like Prim's, Dijkstra, and sorting, making concepts easier to understand.

This article presents a branchless Quicksort implementation using sorting networks and discusses how modern compilers, especially Clang, optimize loops with branch-free instructions when written in the right style.

Unicode string equivalence is complex, especially with collations, leading to surprising results like deletion of control characters and non-deterministic grouping. The author discusses challenges in implementing proper Unicode support in database systems.

A Go engineer recounts an incident where an in-memory datastore became overloaded due to slow sorting, and they implemented context cancellation inside sort functions by using panics and recover for non-local flow control, similar to how encoding/json handles errors.

Explains why the classic Win32 TreeView control offers separate sort methods for name and lParam, and recommends switching to a data model pattern when both are needed for sorting.