@

Dark Mode

Profile
Edit my Profile
Messages
My favorites

Register

Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams

Dark Mode

Cormen Edition 3 Exercise 8.2 Question 2 (Page No. 196)

akash.dinkar12 asked in Algorithms Jun 28, 2019

377 views

0 votes

0 votes

Prove that COUNTING-SORT is stable.

cormen
algorithms
sorting
countingsort
descriptive

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

377 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

0 votes

see the above proof it might help

http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Sorting/countingSort.htm

abhishek tiwary answered Apr 28, 2020

by abhishek tiwary

0 Comments

Please log in or register to add a comment.

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

0 answers

1

akash.dinkar12 asked in Algorithms Jun 28, 2019

349 views

Cormen Edition 3 Exercise 8.2 Question 3 (Page No. 196)
Suppose that we were to rewrite the for loop header in line $10$ of the COUNTINGSORT as 10 for j = 1 to A.length Show that the algorithm still works properly. Is the modified algorithm stable?

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

349 views

cormen
algorithms
sorting
countingsort
descriptive

0 votes

0 votes

0 answers

2

akash.dinkar12 asked in Algorithms Jun 28, 2019

353 views

Cormen Edition 3 Exercise 8.2 Question 1 (Page No. 196)
COUNTING-SORT(A, B, k) 1 let C[0, ,k] be a new array 2 for i = 0 to k 3 C[i] = 0 4 for j = 1 to A.length 5 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[ ... j] 12 C[A[j]] = C[A[j]] - 1 illustrate the operation of COUNTING-SORT on the array $A=\langle 6,0,2,0,1,3,4,6,1,3,2 \rangle $

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

353 views

cormen
algorithms
sorting
countingsort
descriptive

0 votes

0 votes

2 answers

3

akash.dinkar12 asked in Algorithms Jun 28, 2019

1,602 views

Cormen Edition 3 Exercise 8.2 Question 4 (Page No. 197)
Describe an algorithm that, given $n$ integers in the range $0$ to $k$ preprocesses its input and then answers any query about how many of the $n$ integers fall into the range $[a..b]$ in $O(1)$ time.Your algorithm should use $\Theta(n+k)$ preprocessing time.

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

1.6k views

cormen
algorithms
sorting
countingsort
descriptive

1 vote

1 vote

1 answer

4

akash.dinkar12 asked in Algorithms Jun 28, 2019

660 views

Cormen Edition 3 Exercise 8.4 Question 2 (Page No. 204)
Explain why the worst-case running time for bucket sort is $\Theta(n^2)$. What simple change to the algorithm preserves its linear average-case running time and makes its worst-case running time $O(n\ lg\ n)$?

akash.dinkar12 asked in Algorithms Jun 28, 2019

by akash.dinkar12

660 views

cormen
algorithms
sorting
bucket-sort
descriptive

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!