1. Suppose the input is A = <5,2,0,6,1,9,6,5>. A. At the end of execution of the for loop of Lines 5 -- 6, C[0] contains B PM B. At the end of execution of the for loop of Lines 5 -- 6, C[7] contains C. At the end of execution of the for loop of Lines 7 -- 8, C[4] contains D. At the end of execution of the for loop of Lines 7 -- 8, C[7] contains E. When ALGO terminates, B[0] contains F. When ALGO terminates, B[5] contains

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 is A = <5,2,0,6,1,9,6,5>.
A. At the end of execution of the for loop of Lines 5 -- 6, C[0] contains
3 PM
B. At the end of execution of the for loop of Lines 5 -- 6, C[7] contains
C. At the end of execution of the for loop of Lines 7 -- 8, C[4] contains
D. At the end of execution of the for loop of Lines 7 -- 8, C[7] contains
E. When ALGO terminates, B[0] contains
F. When ALGO terminates, B[5] contains
Transcribed Image Text:1. Suppose the input is A = <5,2,0,6,1,9,6,5>. A. At the end of execution of the for loop of Lines 5 -- 6, C[0] contains 3 PM B. At the end of execution of the for loop of Lines 5 -- 6, C[7] contains C. At the end of execution of the for loop of Lines 7 -- 8, C[4] contains D. At the end of execution of the for loop of Lines 7 -- 8, C[7] contains E. When ALGO terminates, B[0] contains F. When ALGO terminates, B[5] contains
Consider the following algorithm, which takes in a length-n array A containing
integers in the range 0 to 9.
Assume that array indexing begins at 0.
ALGO (A)
1: Let B be an array of length n
2: Let C be an array of length 10
3: for i=0 to 9
4:
C[i] = 0
5: for j 0 to n-1
6:
C[A[j]] = C[A[j]] + 1
7: for i=1 to 9
C[i] = C[i] + C[i-1]
8:
9: for j = n-1 down to 0
10:
11:
B[C[A[j]]-1] = A[j]
C[A[j]] = C[A[j]] - 1
Transcribed Image Text:Consider the following algorithm, which takes in a length-n array A containing integers in the range 0 to 9. Assume that array indexing begins at 0. ALGO (A) 1: Let B be an array of length n 2: Let C be an array of length 10 3: for i=0 to 9 4: C[i] = 0 5: for j 0 to n-1 6: C[A[j]] = C[A[j]] + 1 7: for i=1 to 9 C[i] = C[i] + C[i-1] 8: 9: for j = n-1 down to 0 10: 11: B[C[A[j]]-1] = A[j] C[A[j]] = C[A[j]] - 1
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Returning value from Function
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.
Similar questions
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