Code in C only. 2. QuickSort 1: Partition Recall how the partition step in quicksort works. We

Code in C only.

Transcribed Image Text:

2. QuickSort 1: Partition Recall how the partition step in quicksort works. We choose some pivot element, p, and partition your unsorted array, ar, into three smaller arrays: left, right, and equal, where each element in left<p, each element in right>p, and each element in equal=p. Given ar and p=ar[01, partition ar into left, right, and equal using the instructions above. Then print each element in left followed by each element in equal, followed by each element in right on a single line. Your output should be space- separated. Input Format The first line contains n (the size of ar). The second line contains n space-separated integers describing ar (the unsorted array). The first integer (corresponding to ar[0]) is your pivot element, p. Constraints • 1<=n<=1000 • -1000<=ar[i]<=1000 where 0 <= i<n • All elements will be unique. 2. QuickSort 1: Partition Recall how the partition step in quicksort works. We choose some pivot element, p, and partition your unsorted array, ar, into three smaller arrays: left, right, and equal, where each element in left<p, each element in right>p, and each element in equal=p. Given ar and p=ar[01, partition ar into left, right, and equal using the instructions above. Then print each element in left followed by each element in equal, followed by each element in right on a single line. Your output should be space- separated. Input Format The first line contains n (the size of ar). The second line contains n space-separated integers describing ar (the unsorted array). The first integer (corresponding to ar[0]) is your pivot element, p. Constraints • 1<=n<=1000 • -1000<=ar[i]<=1000 where 0 <= i<n • All elements will be unique.

Answer rating: 100% (QA)

Solution Look at the code and comments for better unders... View the full answer