COUNTING-SORT(A, 1 2 3 4 5 B, k) let C[0..k] be a new array for i = 0 to k C[i] = 0 for j = 1 to A.length C[A[j]]= C[A[j]] + 1 6 // C[i] now contains the number of elements equal to i. 7 for i=1 to k 8 C[i] = C[i] + C[i-1] 9 // C[i] now contains the number of elements less than or equal to i. 10 for j= A.length downto 1 11 B[C[A[j]]]= A[j] 12 C[A[j]] C[A[j]]-1 =
COUNTING-SORT(A, 1 2 3 4 5 B, k) let C[0..k] be a new array for i = 0 to k C[i] = 0 for j = 1 to A.length C[A[j]]= C[A[j]] + 1 6 // C[i] now contains the number of elements equal to i. 7 for i=1 to k 8 C[i] = C[i] + C[i-1] 9 // C[i] now contains the number of elements less than or equal to i. 10 for j= A.length downto 1 11 B[C[A[j]]]= A[j] 12 C[A[j]] C[A[j]]-1 =
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...
Related questions
Question
Would downvote if incorrect. Follow pseudo code and code.
![COUNTING-SORT
1
2
3
4
5
(A, B, k)
let C[0..k] be a new array
for i = 0 to k
8
9
10
11
12
C[i] = 0
for j = 1 to A.length
C[A[j]] = C[A[j]] + 1
6
// C[i] now contains the number of elements equal to i.
7 for i=1 to k
C[i] = C[i] + C[i − 1]
// C[i] now contains the number of elements less than or equal to i.
for j= A.length downto 1
B[C [A[j]]] = A[j]
C[A[j]] = C[A[j]] - 1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F5869c55b-c614-4bfc-91ca-f4b03d846c07%2Ff33fba9c-d550-44e5-815c-ff19cc7b6add%2F6zxvq_processed.png&w=3840&q=75)
Transcribed Image Text:COUNTING-SORT
1
2
3
4
5
(A, B, k)
let C[0..k] be a new array
for i = 0 to k
8
9
10
11
12
C[i] = 0
for j = 1 to A.length
C[A[j]] = C[A[j]] + 1
6
// C[i] now contains the number of elements equal to i.
7 for i=1 to k
C[i] = C[i] + C[i − 1]
// C[i] now contains the number of elements less than or equal to i.
for j= A.length downto 1
B[C [A[j]]] = A[j]
C[A[j]] = C[A[j]] - 1
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY