For many years, computer programming students have been writing linked-list code, useful in accessing a collection sequentially. The advantage of a linked list is that you can insert and delete elements from the middle of the collection while not disturbing the rest of it in any way.
How would you like to have all these list operations automated for you... and more?
The Standard Template Library (STL) automates linked-list programming, providing all the standard capabilities of a container, plus several built-in, special capabilities unique to lists, including removal, merging, and splicing.
One of the most useful of these extra functions is sort. This chapter therefore begins by discussing the requirements ...