Thread: Sorting variables with an optimized, specific process

Hello everybody,

so i'm writing a very simple program where the user inputs 3 ints *a, *b, *c, and there is one function that handles the addresses of the integers and sorts them in ascending order. Only problem is, I can not use sort algorithms but specifically use an optimized process that is specific to three items.

I'm having a hard time thinking out of the box on this one, being restricted on various sorts.

I thought that too but being simplistic and optimal is the whole challenge that this is supposed to be and i feel it would be quite a lot of code with those

Forget any sorting code. There is an optimized set of if statements, made just for three items.

To discover it, work it through by hand (don't try sit down and start coding), several times, with 3 coins of different values. You'll need to repeat it until you can see the pattern you are using, to sort them. Once won't be enough.

When you see the pattern, keep doing it until it's really clear what the logic is that you're using. That's the backbone of your if statements.

Only then are you ready to code anything.

Code:

void sortThree(int *a, int *b, int *c);
{
     int swap = 0;
     
     if (*c < *b)
     {
            swap = *c;
            *c = &b;
            *b = &c;
     }
     if (*b < *a)
     {
            swap = *b;
            *b = &a;
            *a = &b;
     }
     if (*b < *c)
     {
            swap = *b;
            *b = &c;
            *c = &b;
     }
}

I know this is wrong but am I kinda on the right track?

Kinda, yes.

You are using if statements and representing the objects to be sorted with variables - that's good.

But you didn't work it out by hand until you saw the pattern - so that stinks, and your logic is wrong because of it.