operating systems

For quicksort fifyou don't remember, it partitions the data, then sorts each partition recursively), suppose we try to speed things up after the frrst partition. We use one thread to sort the values in the first part (less than the "pivof" value) and one thread to sort the values in the second part (greater than the pivot) The second thread needs to wait for the first thread to finish before it can start. There are no problems - the sorting should bedone in half the time The threads probably do not have the same amount of work to do The two threads are working on the same array