On Wednesday, 13 April 2016 at 22:02:19 UTC, Nordlöw wrote:
On Wednesday, 13 April 2016 at 19:58:49 UTC, Andrei
Alexandrescu wrote:
* Cut and paste error at
https://github.com/nordlow/phobos-next/blob/master/src/sortn.d#L90
Fixed.
* I see some sizes are not supported, we should not have holes.
* Sometimes the sort routine gets too bulky. Suggestion: also
define networks for medianOfUpTo and medianExactly, then use
them in a quicksort manner - first compute the median to
segregate values in below/over the median, then make two calls
to sortExactly!(n / 2). That way you get to sort n values with
median of n values (smaller and simpler) and two sorts of n /
2 values.
Added as TODOs for now.
Thanks!
If you want help std algorithm sorting, a better start is to fix
bugs : a lot of functions can't work with swapstrategy stable and
so on.
Me for example suffers from that.
