| |
Quicksort - Wikipedia, the free encyclopedia |
 | | Another variation on this theme which is becoming widely used is introspective sort, often called introsort. |
| | Quicksort is usually faster, though there remains the chance of worst case performance except in the introsort variant. |
| | If it's known in advance that heapsort is going to be necessary, using it directly will be faster than waiting for introsort to switch to it. |
| en.wikipedia.org /wiki/Quicksort (3857 words) |
