On 06/24/2013 09:02 AM, deadalnix wrote:
On Sunday, 23 June 2013 at 11:34:25 UTC, monarch_dodra wrote:For example, try implementing a sort (either merge or q) with a non-sliceable range... very very hard...https://github.com/deadalnix/Dsort/blob/master/sort/bubble.d
(That's neither merge- nor quicksort.) Note: https://github.com/D-Programming-Language/phobos/blob/master/std/range.d#L7952
