Talk:Merge sort.cpp

I changed to a better algorythm: --62.90.23.122 14:52, 7 March 2011 (EST)
 * 1) the previous implementation had a major inefficiency: O(2*n) dynamic allocation of temp containers for the merge. this one only requires the caller to allocate 1 extra container for its temporary usage.
 * 2) this implementation is more generic with respect to container type, order operator and non-throw swapping of elements.


 * Thanks! This is way better, though I think the older example was meant to serve as a working pseudo code that someone can hammer out within 5-10 minutes, but obviously yours is more ready for production! Larry 15:41, 7 March 2011 (EST)