Need with explanation 2

Question

1.00/5 (5 votes)

See more:

You are given the following method signature:

C#

public static int[] MergeAndReorder(int[] a, int[] b) { }

Arrays a and b are both already sorted in ascending order.
How can we return the union of all elements in a and b, sorted in descending order.
You may not use any native sorting functionality of C#, such as SortedList or .OrderBy().
Your variables may only be primitives (and obviously an integer array for the result).

Any one good in programming can do this

Posted 16-Aug-12 2:54am

lalitkr

Updated 16-Aug-12 18:13pm

v3

Add a Solution

Comments

BillW33 16-Aug-12 9:04am

This sounds like a homework assignment. We are not here to do your homework for you.

[no name] 16-Aug-12 9:12am

"Your task ".. enough said.

bbirajdar 16-Aug-12 9:32am

I am not prepared for this task.. :)

3 solutions

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)

E.F. Nijboer · Answer 1 · 2012-08-16T03:11:00

Solution 2

This is not a site for homework assignments. If you aren't interested in programming you probably choose the wrong study.

Good luck!

Posted 16-Aug-12 3:11am

E.F. Nijboer

Comments

Prasad_Kulkarni 17-Aug-12 0:32am

Exactly. A +5

**Malli_S** · Answer 2 · 2012-08-16T03:08:00

Solution 1

This[^] would help you. (To be more precise, do read the 7th point.)

Posted 16-Aug-12 3:08am

Malli_S

Updated 16-Aug-12 3:09am

v2

lukeer · Answer 3 · 2012-08-16T19:56:00

No code, just how I would do the algorithm:

Create a new target integer array. Size should be the added sizes of a and b.

You need three indexes: for a, b and target. The trick to invert sorting direction is to start a and b indexes at their last elements and iterate backwards.

Iterate over the new array. Each element is either copied from a or b, whichever is smaller (in value, not index). The one that copied its value also makes its index move on.

Remember not to use indexes smaller than zero.

Happy coding.