This is sometimes called quasilinear time and is the best achievable complexity for sorting:
O(n log(n))
Get The Complete Rust Programming Reference Guide now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.