1. Suppose the input array is A = <10, 19, 9, 7, 12, 8, 5, 4, 11, 2, 6, 3> A. At the end of the first iteration of the while loop of Line 4, the integer at index 0 of A is B. At the end of the first iteration of the while loop of Line 4, the integer at index 11 of A is C. When ALGO terminates, the integer at index 4 is D. When ALGO terminates, the integer at index 9 is

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
1. Suppose the input array is A = <10, 19, 9, 7, 12, 8, 5, 4, 11, 2, 6, 3>
A. At the end of the first iteration of the while loop of Line 4, the integer at index 0 of A is
B. At the end of the first iteration of the while loop of Line 4, the integer at index 11 of A is
C. When ALGO terminates, the integer at index 4 is
D. When ALGO terminates, the integer at index 9 is
E. The value of r returned by ALGO in Line 12 is
FALS
Tin the text box if it is
Transcribed Image Text:1. Suppose the input array is A = <10, 19, 9, 7, 12, 8, 5, 4, 11, 2, 6, 3> A. At the end of the first iteration of the while loop of Line 4, the integer at index 0 of A is B. At the end of the first iteration of the while loop of Line 4, the integer at index 11 of A is C. When ALGO terminates, the integer at index 4 is D. When ALGO terminates, the integer at index 9 is E. The value of r returned by ALGO in Line 12 is FALS Tin the text box if it is
Consider the following pseudocode ALGO which takes as input an array A containing n integers.
Assume that array indexing begins at 0.
ALGO (A)
1: x = A[0]
2: p = -1
3: r = n
4: while (True) {
5:
do {
6:
7:
8:
STR681
9:
10:
11:
10:
11:
12:
13:
14:
15: }
P = p + 1
} while (A[p] < x)
do {
r = r - 1
} while (A[r] > x)
if ( p >= r ){
return r
}
exchange A[p] and A[r]
Transcribed Image Text:Consider the following pseudocode ALGO which takes as input an array A containing n integers. Assume that array indexing begins at 0. ALGO (A) 1: x = A[0] 2: p = -1 3: r = n 4: while (True) { 5: do { 6: 7: 8: STR681 9: 10: 11: 10: 11: 12: 13: 14: 15: } P = p + 1 } while (A[p] < x) do { r = r - 1 } while (A[r] > x) if ( p >= r ){ return r } exchange A[p] and A[r]
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education