Hi Ariel,
I found your sort library very useful. My tests show that your sedgesort is about 30% faster than the built-in sort function in .NET 4.51 on random inputs which happens to be my use case. I did not test other inputs. I have adapted the code a bit so it compiles on Windows. I also included a .cs class with which you can use the C code built as DLL in a .NET program.

Additionally I adapted the Dual Pivot Quicksort (http://iaroslavski.narod.ru/quicksort/DualPivotQuicksort.pdf) to C and included it. If I use your insort for the small sub array sort it is about as fast as sedgesort on random inputs. I imagine it performs better if the inputs aren't random.

Feel free to put the attached archive on your website. Maybe someone will find it useful.

Jann

--
Jann Röder