C# program to sort a two dimensional array elements in ascending order?(sort the columns first and then the rows) [closed]

Question

Closed. This question needs details or clarity. It is not currently accepting answers.

Want to improve this question? As written, this question is lacking some of the information it needs to be answered. If the author adds details in comments, consider editing them into the question. Once there's sufficient detail to answer, vote to reopen the question.

Closed 11 years ago.

Improve this question

public void ascendingOrder()
{
    // helper class
    double temp = 0;

    for (int j = 0; j < numbers.Length; j++)
    {
        for (int i = 0; i < numbers.Length - 1; i++)
        {
            if (numbers[i] > numbers[i + 1])
            {
                temp = numbers[i];
                numbers[i] = numbers[i + 1];
                numbers[i + 1] = temp;
            }
        }
    }
}

i need the code to sort the columns first and then sort the rows like the following example!

input :

n=3

2 2 1 
3 53 4 
32 5 3

output:

1 2 2 
3 3 54 
4 32 53

Why you just not use Array.Sort and then if you want Reverse?! — Bassam Alugili
– Bassam Alugili, Commented Apr 24, 2014 at 11:47
Your program operates on one dimensional numbers array. Are we supposed to extend you that program for two dimensional arrays? That is not how Stack Overflow works... — Konrad Kokosa
– Konrad Kokosa, Commented Apr 24, 2014 at 11:47
first correct the output, numbers are different from what we see in input. — Andrew
– Andrew, Commented Apr 24, 2014 at 11:48

Community · Accepted Answer · 2017-05-23 12:20:48Z

1

Some helpful links:

edited May 23, 2017 at 12:20

CommunityBot

11 silver badge

answered Apr 24, 2014 at 11:47

Josh Thompson-Smith

581 silver badge11 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Community · Accepted Answer · 2017-05-23 12:28:35Z

1

int[] array = new int[] { 3, 1, 4, 5, 2 };
Array.Sort<int>(array,
                new Comparison<int>(
                        (i1, i2) => i1.CompareTo(i2)
                ));

Better way to sort array in descending order

edited May 23, 2017 at 12:28

CommunityBot

11 silver badge

answered Apr 24, 2014 at 11:47

Bassam Alugili

17.1k8 gold badges56 silver badges72 bronze badges

Comments

leskovar · Accepted Answer · 2014-04-24 11:53:20Z

0

I believe this person is currently writing an exam, so linq methods will not make him pass this test. Try with this code.

        double[,] numbers = new double[,]{ { 1, 3, 2 }, { 4, 6, 5 }, { 7, 9, 8 } };
        // helper class
        double temp = 0;

        for (int k = 0; k < 3; k++)
        {
            for (int j = 0; j < 2; j++)
            {
                for (int i = 1; i < 3; i++)
                {
                    if (numbers[k,i] < numbers[k,j])
                    {
                        temp = numbers[k,i];
                        numbers[k,i] = numbers[k,j];
                        numbers[k,j] =temp;
                    }
                }
            }
        }

answered Apr 24, 2014 at 11:53

leskovar

6613 silver badges8 bronze badges

2 Comments

Konrad Kokosa Over a year ago

And how rewriting an answer will help him to learn something? Aren't exams for such purpose?

leskovar Over a year ago

Let him learn the hard way once he finds a job.

Collectives™ on Stack Overflow

C# program to sort a two dimensional array elements in ascending order?(sort the columns first and then the rows) [closed]

3 Answers 3

Comments

Comments

2 Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

Comments

2 Comments

Linked

Related