plf_indiesort
Sorter
A sorting algorithm that optimizes performance on non-random access containers and large data types
A sort wrapper enabling both use of random-access sorting on non-random access containers, and increased performance for the sorting of large types.
19 stars
4 watching
2 forks
Language: C++
last commit: over 2 years agoLinked from 1 awesome list
sortsorting
fffaraz/awesome-cppRelated projects:
| Repository | Description | Stars |
|---|---|---|
 bonzaithepenguin/wikisort | An optimized sorting algorithm with O(1) memory usage. | 1,273 |
 timsort/cpp-timsort | A C++ implementation of TimSort, an O(n log n) stable sorting algorithm. | 303 |
 addyosmani/bubblesort | A bubble sort algorithm implementation with a comparison function for sorting arrays of elements in ascending or descending order | 107 |
| mattreecebentley/plf_list | A high-performance alternative to the C++ standard library's list container | 150 |
 azat-io/eslint-plugin-perfectionist | A plugin for ESLint that enforces consistent code formatting and organization through rules-based sorting of various data structures. | 2,220 |
| mattreecebentley/plf_stack | A C++ data container optimized for stack-based operations with improved performance compared to standard library containers. | 64 |
 yourbasic/radix | A fast string sorting algorithm implemented in Go. | 192 |
 mattiash/angular-tablesort | A tool for adding sorting functionality to AngularJS tables in a straightforward and flexible way | 185 |
 dancouper/natural_sort | A sorting function for natural ordering of strings containing numbers | 14 |
 scandum/blitsort | An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management | 703 |
 sindresorhus/alpha-sort | A utility function for sorting arrays of strings in various natural and case-insensitive orders | 39 |
 christianbach/tablesorter | A client-side table sorting plugin that provides flexible and customizable sorting capabilities for HTML tables. | 1,029 |
 stoeffel/mergesort | An efficient sorting algorithm with O(n log n) complexity. | 20 |
| scandum/quadsort | A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data | 2,137 |
 bitshifter/radixsort | Provides an implementation of radix sort in C and C++ with various optimization techniques. | 6 |