Speed comparison of parallel merge sort and qsort

Parallel merge sort is my course assignment. And I feel interested that which speed is fast between parallel merge sort and qsort. Therefore, here is an experiment about speed test in parallel merge sort and qsort.

system: linux

Here is parallel merge sort:

output:8 processors 0.000548s
           8 processors 0.000482s
           8 processors 0.000421s
           8 processors 0.000473s
           8 processors 0.000402s

 Here is qsort:

output:  0.000691 secs
             0.000635 secs
             0.000551 secs
             0.000505 secs
             0.000708 secs

Discussion:

   There is no significant difference between parallel merge sort and qsort. I will post the plot analysis later.