Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
i have a silly doubt regarding counting sort.What is the need to get the cumulative sum of all indexes to get sorted array when we can just iterate through the “count” array to reproduce the sorted array by seeing the count for that index.Does it affect the efficiency?
Because typically each element will be of the form
{key,value}, where we’re sorting bykey. The output array needs to contain thevalues. You don’t get them if you simply loop over the counts and regenerate thekeys.