Multithreaded qsort(3)

[Garrett Wollman]

In <45F906ED.8070100 at aueb.gr> you write:

>$ qsort_mt -t -h 2 -n 100000000 -l	# Integers; qsort(3)
>46.5 46.2 0.314
>$ ./qsort_mt  -t -h 2 -n 100000000	# Integers; qsort_mt
>27.5 46.3 0.301

"fancy algorithms have large constants, and N is usually small".

Do you have any reason to believe that N is large with sufficient
frequency to justify the overhead?

-GAWollman