An array is sorted by quick sort. The pivot chosen is 72. What is the position of the pivot after the partition. 72 6 57 88 60 42 83 73 48 85 static > int partition(E[] A, int 1, int r, E pivot) { do {// Move bounds inward until they meet while (A[++1].compareTo(pivot)<0); while ((r!=0) && (A[--r].compareTo(pivot)>0)); DSutil.swap(A, 1, r); } while (1 < r); DSutil.swap(A, 1, r); return 1; } // Swap out-of-place values // Stop when they cross // Reverse last, wasted swap // Return first position in right partition a. 4 b. C. d. 3 е. 6 2.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
An array is sorted by quick sort. The pivot chosen is 72. What is the position of the
pivot after the partition.
72 6
57 88 60 42 83 73 48 85
static <E extends Comparable<? super E>>
int partition(E[] A, int 1, int r, E pivot) {
do {// Move bounds inward until they meet
while (A[++1].compareTo(pivot)<e);
while ((r!=0) && (A[--r].compareTo(pivot)>0));
DSutil.swap(A, 1, r);
} while (1 < r);
DSutil.swap(A, 1, r);
return 1;
}
// Swap out-of-place values
// Stop when they cross
// Reverse last, wasted swap
// Return first position in right partition
а.
4
b. 2
C.
d. 3
е. 6
LO
Transcribed Image Text:An array is sorted by quick sort. The pivot chosen is 72. What is the position of the pivot after the partition. 72 6 57 88 60 42 83 73 48 85 static <E extends Comparable<? super E>> int partition(E[] A, int 1, int r, E pivot) { do {// Move bounds inward until they meet while (A[++1].compareTo(pivot)<e); while ((r!=0) && (A[--r].compareTo(pivot)>0)); DSutil.swap(A, 1, r); } while (1 < r); DSutil.swap(A, 1, r); return 1; } // Swap out-of-place values // Stop when they cross // Reverse last, wasted swap // Return first position in right partition а. 4 b. 2 C. d. 3 е. 6 LO
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY