prenex/myqsort
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

smallest tune

Browse Source
This commit is contained in:
Richard Thier 2025-05-09 06:44:19 +02:00
parent 38ac7a8a51
commit 21c9d52138
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
schwab_sort.h
View File

@ -114,7 +114,7 @@ inline void sch_insertion_sort(uint32_t *arr, int low, int high) {
/* Dual heapsort5 probably helps insertion speed */ /* Dual heapsort5 probably helps insertion speed */
/* This is sane, because insertion benefits from */ /* This is sane, because insertion benefits from */
/* data being "basically nearly sorted" as input */ /* data being "basically nearly sorted" as input */
if(high + 1 - low > 10) { if(high - low > 10) {
sch_hsort5(&arr[0]); sch_hsort5(&arr[0]);
sch_hsort5(&arr[5]); sch_hsort5(&arr[5]);
} }