I am now looking at my old school assignment and want to find the solution of a question.
Which sorting method is most suitable for parallel processing?
I guess quick sort (or merge sort?) is the answer.
Am I correct?
It is merge sort since the sorting is done on two sub arrays and they are compared and sorted at the end. these can be done in parallel