How do I implement the following question

Question

0.00/5 (No votes)

See more:

Let S1, S2, . . . , Sk be k different sequences whose elements have integer keys in the range [0,N − 1], for some parameter N ≥ 2. Describe an algorithm running in O(n+N) time for sorting all the sequences, where n denotes the total size of all the sequences.

What I have tried:

I am not getting the basic idea for this

Posted 27-Feb-21 22:08pm

Aryan Khanna

Updated 27-Feb-21 23:16pm

Add a Solution

Comments

Daniel Pfeffer 28-Feb-21 4:29am

This sounds like a homework problem. If you don't understand it, why not ask your teacher to explain it again to you? That's his/her job...

Aryan Khanna 28-Feb-21 4:48am

Our teacher is not very helpful
He just tells us to try on our own

Richard MacCutchan 28-Feb-21 4:58am

Exactly right, as the whole point of this question (and all other assignments) is to test how much you have learned, and how much research you can do on your own. You could start by creating some of the mentioned sequences on paper and think about how you would go about sorting the numbers.

Aryan Khanna 28-Feb-21 5:01am

I just have one doubt
Do I have to use radix sort?

Aryan Khanna 28-Feb-21 5:02am

But in this case for the time complexity they've given that n should be the sum if the size of the sequences

Richard MacCutchan 28-Feb-21 5:30am

It is up to you to find the optimum sort method to solve the problem. It is called "trial and error".

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Patrice T · Answer 1 · 2021-02-27T23:16:00

Solution 1

Quote:
How do I implement the following question

Have a look here:
Counting Sort - GeeksforGeeks[^]
Counting sort - Wikipedia[^]

Posted 27-Feb-21 23:16pm

Patrice T