Expand description
§Nexus Sort: A Cognitive, Multi-Strategy Sorting Framework
This library provides nexus_sort, a novel sorting algorithm designed for high
performance by intelligently choosing the best sorting strategy for your data.
§Core Features
- Cognitive Engine: Analyzes data to select between Radix Sort, Timsort (stable), or Introsort (unstable).
- High-Performance: Outperforms standard library sorts in many common scenarios, especially on numeric data.
- Specialized Functions: Provides
nexus_sort()forOrdtypes (like integers) andnexus_sort_f32()for floating-point numbers.
§Example
use nexus_sort_core::nexus_sort;
let mut my_vec = vec!;
nexus_sort(&mut my_vec);
assert_eq!(my_vec, vec!);§Nexus Sort: A Cognitive, Multi-Strategy Sorting Framework
… (documentation remains the same)
Modules§
Constants§
Functions§
- nexus_
sort - Sorts a slice of elements that implement the
Ordtrait (e.g.,i32,u32). - nexus_
sort_ f32 - Sorts a slice of
f32floating-point numbers.