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

Compare commits

base: prenex:5d6ea0e778aea1b291a716de1f531436a660410b
Branches Tags
prenex:master
...
compare: prenex:0b864ad2f0eb302b8df8885086fbd6cb58af262f
Branches Tags
prenex:master

2 Commits
5d6ea0e778 ... 0b864ad2f0

Author SHA1 Message Date
Richard Thier
0b864ad2f0 bugfixed branchless code having extra nonSameIndex - but was working when only half of it is branchless 2025-05-06 02:27:38 +02:00
Richard Thier
09ed5dd548 branchless partition3_sp2 - only half is branchless but already faster 2025-05-05 23:04:27 +02:00
1 changed files with 10 additions and 8 deletions
Show Stats Expand all files Collapse all files

18
qsort.h
View File

@ -258,19 +258,21 @@ static inline pret3 partition3_sp2(uint32_t array[], int low, int high, uint32_t
while(jl <= jr) {
/* Handle left and find wrongly placed element */
while((array[jl] <= pivotval) && (jl <= jr)) {
if(array[jl] != pivotval) {
if(++il != jl)
swapit(&array[il], &array[jl]);
}
int isNonPivot = (array[jl] != pivotval);
int nonSameIndex = (il + 1 != jl);
if(isNonPivot & nonSameIndex)
swapit(&array[il + 1], &array[jl]);
il += isNonPivot;
++jl;
}
/* Handle right and find wrongly placed element */
while((array[jr] >= pivotval) && (jl <= jr)) {
if(array[jr] != pivotval) {
if(--ir != jr)
swapit(&array[ir], &array[jr]);
}
int isNonPivot = (array[jr] != pivotval);
int nonSameIndex = (ir - 1 != jr);
if(isNonPivot & nonSameIndex)
swapit(&array[ir - 1], &array[jr]);
ir -= isNonPivot;
--jr;
}