Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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. 8: 9: for j n-1 down to 10: 11: C[i] = C[i] + C[i-1] B[C[A[J]]-1] = A[j] C[A[J]]= C[A[j]] - 1

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. 8: 9: for j n-1 down to 10: 11: C[i] = C[i] + C[i-1] B[C[A[J]]-1] = A[j] C[A[J]]= C[A[j]] - 1

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

I need help tracing the following algorithm ( by hand manually), which takes in length-n array A containing integers ranging from 0 to 9.  Assume that the array indexing begins at 0

Suppose the input is A = <5,2,0,6,1,9,6,5>.  

(Need help in Tracing for the following questions )

1)At the end of the execution of the for loop of Lines 7--8, what does C[7] contain?  

2)When ALGO terminates, the value of  B[0]  is?

3)When ALGO terminates, the value of  B[5]  is?

For reference Answer to Q1 is 7, Q2 is 0 and Q3 is 6.

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: 5: for 6: C[i] = 0 j = 0 to n-1 C[A[j]] C[A[j]] + 1 = 7: for i=1 to 9 8: C[i] = C[i] + C[i-1] 9: for j = n-1 down to 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: 5: for 6: C[i] = 0 j = 0 to n-1 C[A[j]] C[A[j]] + 1 = 7: for i=1 to 9 8: C[i] = C[i] + C[i-1] 9: for j = n-1 down to 10: 11: B[C[A[j]]-1] = A[j] C[A[J]]= C[A[j]] - 1
Expert Solution
steps

Step by step

Solved in 4 steps with 9 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS