• Home
 · 
• String Manipulation
 · 
• A quicker Quicksort (up to 100 times faster)

A quicker Quicksort (up to 100 times faster)

Quicksort which works by sorting string pointers only instead of the strings themselves. In particular for long strings around 1000 chars there is a 15 times improvement in speed, going up to 100 times for really long strings, and speed is almost indepent of string length; one million strings are sorted in under five seconds. For short strings below 10 chars or so speeds are more or less identical. The screenshot shows the compiled timing.

Rate A quicker Quicksort (up to 100 times faster)

• 1
• 2
• 3
• 4
• 5

(10(10 Vote))

Download A quicker Quicksort (up to 100 times faster)