I have used my Parallel Sort Library and benchmarked an Object Pascal
program that sorts a dynamic array of 10 millions of strings.
Please look at the benchmarks in following page:
On four cores four threads, here is the results:
Parallel Quicksort gives 5.31x speed and 2.877 seconds
Parallel Heapsort gave me 4.72x and 7.452 seconds
Note: Parallel Quicksort is much faster in pratice than parallel heapsort
or parallel mergesort.
Amine Moulay Ramdane.