Code the Shared-Memory formulation of Quicksort algorithm for an array of randomly generated integer values with number of elements equal to 16 million. The number of threads must be varied as 8, 16, and/or 32 threads. Draw a table of Speed-up and Efficiency for above mentioned number of threads in comparison to the serial Quicksort algorithm. You need to try to write 1 code that can both work as serial or parallel version. If not possible, then write two different versions. Give your code along with the table for speed-up and efficiency. Write code using OpenMP

Sha on