Concurrency - Computer Systems Engineering - Engineering Assignment Help

Assignment Task

Concurrent Quicksort
Quicksort is a Divide and Conquer sorting algorithm. It is one of the most efficient sorting algorithms and is based on the idea of splitting an array into smaller ones.
The algorithm first picks an element called a pivot and partitions the array into a low subarray, elements smaller than the pivot and a high subarray, elements greater
than the pivot. This step is called the partitioning step.
Quicksort algorithm recursively applies the above step to the sub-arrays, resulting in sorting the array.

In this task, you are given the number of elements in the array N, and the elements of the array. You are required to sort the numbers using a Concurrent version of
Quicksort algorithm.

Tasks
1. Implement a Concurrent version of Quicksort algorithm
2. Make a detailed report
a. Explains your implementation for the Concurrent Quicksort algorithm
b. Compares the performance of Concurrent Quicksort with normal Quicksort

Bonus Task
1. Implement a variant of Concurrent Quicksort algorithm, which uses threads instead of processes.
2. Compare the performance of this variant of the algorithm with the ones implemented as a part of the above mentioned tasks.

This Engineering Assignment has been solved by our Engineering experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.