Content deleted Content added
Reorganized discussion; reformatted text. |
about the examples |
||
Line 66:
it's easily possible to write an unstable, but otherwise
valid, merge sort. -- jpl
== about the examples ==
I removed the comments about the STL merge implementation being more efficient than the presented source code because there's no guarantee of the STL's implementation performance, or approachability, for any specific task. The assertion I removed doesn't apply in all cases, and can't be presented as fact without much more context and discussion.
Meanwhile, I am wondering why the examples don't implement the pseudo code presented at the beginning of the article. The examples have no comments and don't explain what their parameters are. The C and C++ versions don't bother to check the length of the target array.
Should I add comments, and rewrite the samples to more closely match the pseudocode?
| |||