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

debug

Browse Source
This commit is contained in:
Richard Thier 2023-07-02 15:56:21 +02:00
parent 1c32648026
commit e3c229337c
2 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
thiersort.h
View File

@ -619,8 +619,10 @@ fprintf(stderr, "p: %d\n", pivotkey.u);
TSU32 lefti = arr[left].i; TSU32 lefti = arr[left].i;
while((left < right) && lt(leftkey, pivotkey, lefti, pivoti, reent_data)) { while((left < right) && lt(leftkey, pivotkey, lefti, pivoti, reent_data)) {
/* Step */ /* Step */
if(from == 696203)
fprintf(stderr, "L... %d\n", left); fprintf(stderr, "L... %d\n", left);
++left; ++left;
if(from == 696203)
fprintf(stderr, "...L %d\n", left); fprintf(stderr, "...L %d\n", left);
leftkey = arr[left].key; leftkey = arr[left].key;
lefti = arr[left].i; lefti = arr[left].i;

2
ypsu.cpp
View File

@ -575,7 +575,7 @@ int main(void) {
assert(w == expected); assert(w == expected);
*/ */
w = v; w = v;
//w = {10, 20, 5, 200, 42, 41, 43, 5}; w = {10, 20, 20};
measure(inputtype, "qsmine", [&] { thier_quicksort(&w[0], w.size()); }); measure(inputtype, "qsmine", [&] { thier_quicksort(&w[0], w.size()); });
if(w != expected) { if(w != expected) {
for(uint32_t i = 0; i < n; ++i) { for(uint32_t i = 0; i < n; ++i) {