STL list::sort()

template <class T, class Alloc>
template <class T, class Alloc>
void list<T, Alloc>::sort()
{
if (node->next == node || link_type(node->next)->next == node)
return;

list<T, Alloc> carry;
list<T, Alloc> counter[64];
int fill = 0;
while (!empty())
{
    carry.splice(carry.begin(), *this, begin());
    int i = 0;
    while (i < fill && !counter[i].empty())
    {
        counter[i].merge(carry);
        carry.swap(counter[i++]);
    }
    carry.swap(counter[i]);
    if (i == fill)
    ++fill;
}

for (int i = 1; i < fill; ++i)
counter[i].merge(counter[i - 1]);

swap(counter[fill - 1]);
}

侯捷说是快排0_0！！！。
太渣就不分析了，网上好多大佬都分析了。。。