8 ms·
> What length were these tests run at? The first example is "assembly code they published for sorting an array with three items" - this isn't an entire general
by jstanley 3y ago
> What length were these tests run at?
The first example is "assembly code they published for sorting an array with three items" - this isn't an entire general-purpose sorting algorithm, it's just the innermost part.
- mlochbaum 3y agoSecond part of the article, starting at "I thought it'd be useful to share something that's actually portable and executable".
- srcreigh 3y agoThe alpha dev post claims 1.7% improvement on large sequences (250k+)
- refulgentis 3y agoYes, and as both posts say, that’s because large sequences are implemented by building up from small sequences :)