mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-08-03 16:30:29 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add more sorting algorithms

Browse source
This commit is contained in:
Justine Tunney 2023-04-27 05:42:10 -07:00
parent b7bf052a4b
commit 7c9ef924bf
No known key found for this signature in database
GPG key ID: BE714B4575D6E328
17 changed files with 49004 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

23
third_party/vqsort/README.cosmo vendored Normal file
View file

@ -0,0 +1,23 @@
DESCRIPTION
vqsort implements vectorized quicksort using avx2. this is the fastest
way to sort integers. this goes as fast as djbsort for 32-bit integers
except it supports 64-bit integers too, which go just as fast: about a
gigabyte of memory sorted per second. It's 3x faster than simple radix
sort. It's 5x faster than simple quicksort. It's 10x faster than qsort
LICENSE
Apache 2.o
ORIGIN
https://github.com/google/highway/
commit 50331e0523bbf5f6c94b94263a91680f118e0986
Author: Jan Wassenberg <janwas@google.com>
Date: Wed Apr 26 11:20:33 2023 -0700
Faster vqsort for small arrays (7x speedup! for N=100)
LOCAL CHANGES
Precompiled beacuse upstream codebase is slow, gigantic, and hairy.