Sort a string array based on an int array without Array.Sort

Question

I need to sort an array of strings based on the array of ints.

I have this to sort my int array

    for (int pass = 0; pass < score.Length - ONE; pass++)
    {
        for (int index = 0; index < score.Length - ONE; index++)
        {
            if (score[index] > score[index + ONE])
            {
                int temp = score[index];
                score[index] = score[index + ONE];
                score[index + 1] = temp;
            }
        }
    }

This int and name array were obtained by

Console.Write("Enter in a name and score: ", i);
userInput = Console.ReadLine();
if (userInput != "")
{
    parsedInput = userInput.Split();
    name[i] = parsedInput[ZERO];
    score[i] = int.Parse(parsedInput[ONE]);
}

For my assignment I need to display the name and their scores organized by the highest score.

I know I could use Array.Sort(score, name) to achieve this but the assignment wants me to not use any of the built in sorting algorithms in the .net library, which is assume Array.Sort would be.

Any tips or help would be greatly appreciated.

@user2781666, 0 and 1 are not magic numbers in this context. An example of a magic number would be something like 2781666 meaning "sort by name, then by date, and return hidden records", which indeed is better abstracted by constants or enumerated flags. — Frédéric Hamidi
– Frédéric Hamidi, Commented Nov 29, 2013 at 23:45
@user2781666: The constants ONE and ZERO are still magic numbers, only disguised as constants. To really avoid magic numbers you should use a constant for each use of a number, for example const int ItemDistance = 1; to use in the loop to get to the previous and next item, and const int NameIndex = 0; const int ScoreIndex = 1; to access the items in the array. — Guffa
– Guffa, Commented Nov 29, 2013 at 23:50
Oh that makes sense, so when it's a basic algorithm form then 1 and 0 would be ok? That makes a lot more sense — user2781666
– user2781666, Commented Nov 29, 2013 at 23:50

Justin · Accepted Answer · 2013-11-29 23:44:21Z

1

You need to rearrange name when you are sorting score so that they are consistent.

for (int pass = 0; pass < score.Length - ONE; pass++)
{
    for (int index = 0; index < score.Length - ONE; index++)
    {
        if (score[index] > score[index + ONE])
        {
            int temp = score[index];
            score[index] = score[index + ONE];
            score[index + 1] = temp;

            string temp2 = name[index];
            name[index] = name[index + ONE];
            name[index + 1] = temp2;
        }
    }
}

answered Nov 29, 2013 at 23:44

Justin

4724 silver badges16 bronze badges

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

2 Comments

user2781666 Over a year ago

Awesome, that works perfectly. I didn't think it would be that easy.

Justin Over a year ago

If this answer helped you, you can accept the answer with the check mark to indicate that you no longer require help with this question.

Guffa · Accepted Answer · 2013-11-29 23:44:33Z

0

When you swap the items in the int array, also swap the corresponding items in the string array. That way the values follow each other, and the name and score remain in sync.

Note that the sorting algorithm is an inefficient version of bubble sort. If there are no swaps in a run of the inner loop, the array is sorted and you can exit out of the outer loop.

answered Nov 29, 2013 at 23:44

Guffa

703k112 gold badges760 silver badges1k bronze badges

Collectives™ on Stack Overflow

Sort a string array based on an int array without Array.Sort

2 Answers 2

2 Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

2 Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related