Timeline for My BRESort adaptive sorting engine in C
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13 at 14:52 | comment | added | chux | @LazyCauchPotato There are many was to sort FP given NaN. At least the sort criteria should explain how it handles NaNs. | |
| Oct 11 at 18:25 | comment | added | LazyCauchPotato | You were absolutely right about the function pointer overhead! My validation show significant gains in performance! | |
| Oct 11 at 18:01 | comment | added | LazyCauchPotato | As for the function pointer overhead in qsort, yeah... you're right. Changing my test | |
| Oct 11 at 17:56 | comment | added | LazyCauchPotato | Really appreciate that you took your time to review the code! I will make these corrections in the full blown version of BRESort - this 'byte' version is a test run to assess the concept and get a reality check! The full version extends this intelligent approach to 32/64-bit integers and floating-point data. | |
| Oct 11 at 15:15 | history | edited | chux | CC BY-SA 4.0 |
added 154 characters in body
|
| Oct 11 at 15:07 | history | answered | chux | CC BY-SA 4.0 |