Benchmark results using vqsort's bench_sort on Skylake workstation (patch: https://github.com/google/highway/pull/1140 https://github.com/google/highway/pull/11

Benchmark results using vqsort's bench_sort on Skylake workstation (patch: https://github.com/google/highway/pull/1140 https://github.com/google/highway/pull/1140) vqsort is about 1.9x and 1.8x as fast on 1M keys and 100M uniform random keys, respectively. Note that this code did not pass the benchmark's verification. AVX3: vq: i32: uniform32: 1.00E+06 1051 MB/s ( 1 threads) AVX3: intel: i32: uniform32: 1.00E+06 539 MB/s ( 1 threads) AVX3: vq: i64: uniform32: 1.00E+06 1000 MB/s ( 1 threads) AVX3: intel: i64: uniform32: 1.00E+06 500 MB/s ( 1 threads) AVX3: vq: i32: uniform32: 1.00E+08 614 MB/s ( 1 threads) AVX3: intel: i32: uniform32: 1.00E+08 345 MB/s ( 1 threads) AVX3: vq: i64: uniform32: 1.00E+08 584 MB/s ( 1 threads) AVX3: intel: i64: uniform32: 1.00E+08 314 MB/s ( 1 threads)