Excellent. I guess I need to review my group settings so I see the
responses. I'll review those tests tomorrow.
I should have written the midpoint as just /2 instead of shift and the
initial == check isn't necessary. Seems the Go version on GitHub has some
interest.
--David
On
Did a quick translation of the implementation
https://github.com/egonelbre/exp/tree/master/sorts/qpsort
The implementation seems to fail some Go tests.
--- FAIL: TestSortBM (0.00s)
sort_test.go:168: n=100 m=1 dist=stagger mode=copy: used 840 swaps
sorting slice of 100
--- FAIL:
This definitely sounds interesting. Will be glad to help out.
On Wednesday, 22 November 2017 23:33:18 UTC+5:30, David McManamon wrote:
>
> Sometimes it takes years for great technical papers to be implemented. As
> a fun exercise to compare Java's dual-pivot (since so much work went into
>
