Mountain-sort Alternatives

Similar projects and alternatives to mountain-sort

rust

2,683 93,041 10.0 Rust mountain-sort VS rust

Empowering everyone to build reliable and efficient software.
highway

66 3,656 9.8 C++ mountain-sort VS highway

Performance-portable, length-agnostic SIMD with runtime dispatch
InfluxDB

www.influxdata.com featured

Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
sort-research-rs

47 292 9.0 Rust mountain-sort VS sort-research-rs

Test and benchmark suite for sort implementations.
quadsort

9 2,106 4.6 C mountain-sort VS quadsort

Quadsort is a branchless stable adaptive mergesort faster than quicksort.
fluxsort

12 662 6.4 C mountain-sort VS fluxsort

A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.
rotate

4 143 10.0 C mountain-sort VS rotate

A collection of array rotation algorithms.
Presentations

1 7 10.0 C++ mountain-sort VS Presentations

Collection of personal presentations (by Voultapher)
SaaSHub

www.saashub.com featured

SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better mountain-sort alternative or higher similarity.

Suggest an alternative to mountain-sort

mountain-sort reviews and mentions

Posts with mentions or reviews of mountain-sort. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-06-10.

10~17x faster than what? A performance analysis of Intel x86-SIMD-sort (AVX-512)
12 projects | news.ycombinator.com | 10 Jun 2023

It depends on the size of the structs. For struct pointers you're likely better off sorting keys and pointers simultaneously. It doesn't matter much until you get to large sizes (millions), but sorting indices and then selecting with them is random access. If the original ordering is messy, selecting can be slower than the sorting step. For structs a few words long, the unit you're moving is a larger portion of a cache line, and I'd expect the data movement to drown out any SIMD advantage. A radix sort might be all right because it moves less, but I'd probably go with sorting indices as the first thing to try unless I knew the arrays were huge. For very large structs there's an interesting effort called mountain sort[0], "probably the best sorting algorithm if you need to sort actual mountains by height". Given that it minimizes number of moves it's ignoring cache entirely. I haven't benchmarked so I can't say much about how practical it is.
[0] https://github.com/Morwenn/mountain-sort