3 ms·
How does the speed compare to a well optimized radix sort?
by adgjlsfhk1 4y ago
How does the speed compare to a well optimized radix sort?
- orlp 4y agoI haven't compared because they're apples and oranges. The radix sorts do not allow a custom comparison function. I would assume that they're faster, especially if using SIMD.
- adgjlsfhk1 4y agoRadix sorts actually can be used with many custom comparisons by using a sort by api which is enough to let you express many of the uses of custom sorting (e.g. sorting objects by fields, sorting by absolute value, etc). Given the overhead of radix sorts, it wouldn't shock me if this was faster for small sizes.