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

mormord sort further optimizations (for me slower - btw it might need to be called mormord-prenex-magyarsort at this point? I added a lot to it tbh like copied parts of thiersort for this to work)

Browse Source
This commit is contained in:
Richard Thier 2024-04-11 17:18:39 +02:00
parent 02bad1f59f
commit bccb1d0703
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
ypsu.cpp
View File

@ -196,17 +196,17 @@ static inline void mormord_sort_impl(uint32_t *a, int n, int j) noexcept {
uint32_t pivoti = 0; uint32_t pivoti = 0;
while(pivoti < n) { while(pivoti < n) {
uint32_t radixval = morgrab(a[pivoti], j); uint32_t radixval = morgrab(a[pivoti], j);
uint32_t targeti = radics[radixval] - 1; uint32_t targeti = --radics[radixval]; // already dec index for swap
if(targeti > pivoti) { if(targeti > pivoti) {
// swap // swap
uint32_t tmp = a[pivoti]; uint32_t tmp = a[pivoti];
a[pivoti] = a[targeti]; a[pivoti] = a[targeti];
a[targeti] = tmp; a[targeti] = tmp;
// dec index
--radics[radixval];
} else { } else {
// progress pivot // progress pivot
++pivoti; ++pivoti;
// "undec" index
++radics[radixval];
} }
} }