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

hopefully fixing internal quicksorts?

Browse Source
This commit is contained in:
Richard Thier 2023-06-30 16:39:56 +02:00
parent 96e9fb4440
commit 36189e8a3c
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
thiersort.h
View File

@ -581,7 +581,7 @@ static inline void ts_quicksort_inplace(
/* Just simple recursion for now */
ts_quicksort_inplace(arr, from, left, lt, reent_data);
ts_quicksort_inplace(arr, left, to, lt, reent_data);
ts_quicksort_inplace(arr, left + 1, to, lt, reent_data);
}
/**
@ -622,7 +622,7 @@ static inline void ts_quicksort_fromto(
/* Can use inplace steps from now on */
ts_quicksort_inplace(dst, from, li, lt, reent_data);
ts_quicksort_inplace(dst, li, to, lt, reent_data);
ts_quicksort_inplace(dst, li + 1, to, lt, reent_data);
}
/** Internal code reuse (type-branches should be optimized out) */