COUNTING-SORT(A, B, k) 1 let C[0.k] be a new array 2 for i = 0 to k C[i] = 0 4 for j = 1 to A.length C[A[j]] = C[A[j]] +1 3 5 6 |/ C[i] now contains the number of elements equal to i. 7 for i = 1 to k C[i] = C[i]+ [i – 1] 8 9 |/ C[i] now contains the number of elements less than or equal to i. 10 for j = A.length downto 1 B[C[A[j]] = A[i] C[A[j]] = C[A[j]] – 1 11 12
COUNTING-SORT(A, B, k) 1 let C[0.k] be a new array 2 for i = 0 to k C[i] = 0 4 for j = 1 to A.length C[A[j]] = C[A[j]] +1 3 5 6 |/ C[i] now contains the number of elements equal to i. 7 for i = 1 to k C[i] = C[i]+ [i – 1] 8 9 |/ C[i] now contains the number of elements less than or equal to i. 10 for j = A.length downto 1 B[C[A[j]] = A[i] C[A[j]] = C[A[j]] – 1 11 12
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
pseudo-code for counting sort is given in screenshot.
Implement the counting sort
![COUNTING-SORT(A, B, k)
1 let C[0.k] be a new array
2 for i = 0 to k
C[i] = 0
for j = 1 to A.length
C[A[j]] = C[A[j]] + 1
3
5
6 I/ C[i] now contains the number of elements equal to i.
7 for i = 1 tok
C[i] = C[i] + C[i – 1]
8
9 |/ C[i] now contains the number of elements less than or equal to i.
10 for j = A.length downto 1
B[C[A[j] = A[j]
C[A[j]] = C[A[j]] – 1
11
12](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8521e12d-1c50-463a-a3e5-06dbbbf0bb2d%2F49650ac0-f4d6-48c2-a3d4-a92cd02cd3e9%2F53l7bl_processed.png&w=3840&q=75)
Transcribed Image Text:COUNTING-SORT(A, B, k)
1 let C[0.k] be a new array
2 for i = 0 to k
C[i] = 0
for j = 1 to A.length
C[A[j]] = C[A[j]] + 1
3
5
6 I/ C[i] now contains the number of elements equal to i.
7 for i = 1 tok
C[i] = C[i] + C[i – 1]
8
9 |/ C[i] now contains the number of elements less than or equal to i.
10 for j = A.length downto 1
B[C[A[j] = A[j]
C[A[j]] = C[A[j]] – 1
11
12
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 3 images
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