Question: Modify the Partition function so that after running it, any input array A is partitioned into three parts: the left part consisting of all elements
Write down the pseudo-code for this modified version of the Partition function. (must be an in-place algorithm with (n) time complexity.)
Hint: Define three indices: i as the end of the left part, k as the end of the middle part, and j denoting the current index which is used in the for-loop.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
