1 Oct
2015
1 Oct
'15
3:08 p.m.
On Oct 1, 2015, at 10:24 AM, Marshall Clow
However, while I was doing this, I thought of a different algorithm; one that gathered all the elements into the subrange as if the entire range was sorted, but didn't actually do the sorting.
I've implemented that one, too - but I'm having a bit of trouble coming up with a name.
I've used "partition_subrange", but that not that clear. Sean has suggested "elements_in_subrange" and "elements_within_subrange".
Any suggestions?
Given sort_subrange(), partition_subrange() is clear to me. Josh