Tech News
← Home  ·  All topics

Quicksort

3 GoKawiil briefs on this topic · RSS for quicksort

New open-source blqsort algorithm outperforms C++ std::sort on benchmarks

A developer released blqsort, a quicksort implementation available on GitHub under the MIT license, with both C++ and C versions including multithreaded variants. Benchmarks on Apple M1 and Intel i5-9300H systems show blqsort sorting 50 million random doubles, partially sorted data, and structs faster than both std::sort and the ipnsort ClickHouse C++ port.

Developer argues Pratt parsing can be used without understanding its algorithm

A programmer writes that Pratt parsing, often explained through a compact 9-line recursive function using binding powers, can be effectively applied without studying how the algorithm works internally. They cite building a Pratt-based parser for their own compiler project without first understanding the code's implementation details.

Google engineers build a vectorized Quicksort implementation

Google has released a new sorting algorithm that reimagines the classic Quicksort using vectorized, SIMD-based operations to speed up processing on modern CPUs. The project applies hardware-level parallelism to a decades-old algorithm, aiming to boost performance for large-scale sorting tasks.