Linked list Quick & List-based sorting

I used to know that the list is easy to sort by (plain, non-binary). Now I know. (single) The list is also good for quick sorting (just not the same as in the normal way of the quick row).

Reference:

http://blog.csdn.net/otuhacker/article/details/10366563

We only need two pointers p and Q, both pointers move in the next direction, the movement of the process to keep p before the key is less than the selected Key,p and q between the key is greater than the selected key, then when Q went to the end of the time to complete a fulcrum of the search. As shown in the following:

Linked list Quick & List-based sorting