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

removed debug logs from last commits debugging

Browse Source
This commit is contained in:
Richard Thier 2025-04-07 05:05:10 +02:00
parent 69adbe4ae9
commit 37ed6c4f59
1 changed files with 1 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
qsort.h
View File

@ -373,14 +373,9 @@ static inline int partition_with_pivotval(uint32_t array[], int low, int high, u
/* Must check if above loop found elem at all - because its guessing */ /* Must check if above loop found elem at all - because its guessing */
if(i != (low - 1)) { if(i != (low - 1)) {
// TODO: Remove debug stuff
printf("array:i[%d:i]: %d <---> %d :array:pivoti[%d] @ pivotval: %u && [%u..%u]\n",
i, array[i], array[pivoti], pivoti, pivotval, low, high);
/* swap the pivot element into its place */ /* swap the pivot element into its place */
swapit(&array[i], &array[pivoti]); swapit(&array[i], &array[pivoti]);
} else printf("array:i[%d:i]: %d <-/-> %d :array:pivoti[%d] @ pivotval: %u && [%u..%u]\n", }
i, array[i], array[pivoti], pivoti, pivotval, low, high);
/* return the partition point: index of pivot element */ /* return the partition point: index of pivot element */
return i; return i;