Home / Answered Questions / Other / here-is-pseudo-code-for-the-partition-step-of-quick-sort-which-rearranges-the-subarray-a-p-r-in-plac-aw418

# (Solved): Here Is Pseudo Code For The Partition Step Of Quick Sort, Which Rearranges The Subarray A[p ... R] I...

Here is pseudo code for the partition step of Quick Sort, which rearranges the subarray A[p ... r] in place and takes the last element as the pivot:

Partition(A, p, r){

x = A[r]

i = p-1

for j=p to r-1{

if A[j] â‰¤ x {

i = i + 1

swap A[i] with A[j]

}

}

swap A[i+1] with A[r]

return i+1

}

Which of the following is a useful loop invariant for this function?

Group of answer choices

A[r] is the pivot.

All entries in A[p ... i+1] are â‰¤ x.

All entries in A[p ... i] are â‰¤ x.

All entries in A[i+1 ... jâˆ’1] are > x.

All entries in A[i ... j] are > x.

i â‰¤ j

Here is pseudo code for the partition step of Quick Sort, which rearranges the subarray A[p...r] in place and takes the last element as the pivot: Partition(A, P, TX x = A[r] i = p-1 for j=p to 1-1{ if A[j] SX{ i = i + 1 swap A[i] with A[j] swap A[i+1] with A[r] return 1+1 Which of the following is a useful loop invariant for this function? A[r] is the pivot. All entries in AÅ¿p ... i+1] are < x. All entries in AÅ¿p... i) are sx. All entries in A[i+1 ... j-1] are > X. All entries in A[i ... j] are > X. Ois

We have an Answer from Expert