Sort 3 numbers in a single line.

[Hasan Ammar]

Lets suppose we have a function to sort 3 integers, is it possible to
sort and return them in a single statement?

example:

bool sort(int a, int b, int c) {
return // this is where the code goes.... ;
}

is it possible without using an external function to swap two values?

[Gernot Frisch]

"Hasan Ammar" <am****@gmail.com> schrieb im Newsbeitrag
news:ci********@odak26.prod.google.com...

Lets suppose we have a function to sort 3 integers, is it possible
to
sort and return them in a single statement?

example:

bool sort(int a, int b, int c) {
return // this is where the code goes.... ;
}
na = max(a, max(b,c));
nc = min(a, min(b,c));
nb = (na==a)?(nc==c ? b : c) : (nc==c ? b : a);
is it possible without using an external function to swap two
values?

for integers only:
#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^(a);}
--
-Gernot
int main(int argc, char** argv) {printf
("%silto%c%cf%cgl%ssic%ccom%c", "ma", 58, 'g', 64, "ba", 46, 10);}

________________________________________
Looking for a good game? Do it yourself!
GLBasic - you can do
www.GLBasic.com

[Dave Rahardja]

> for integers only:

#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^(a);}

Holy smokes Batman!

[chris]

Hasan Ammar wrote:

Lets suppose we have a function to sort 3 integers, is it possible to
sort and return them in a single statement?

example:

bool sort(int a, int b, int c) {
return // this is where the code goes.... ;
}
I think you need to think a bit more about what you want to do..

for a start, your function returns bool. You can't return a list of 3
sorted integers via a bool.

Do you want something like void sort(int &a,int &b,int &c) {..}, where
sort(x,y,z) will change the actual values of x,y and z, or do you want
something more like vector<int> sort(int a,int b,int c), where you
return a vector with the variables sorted?


is it possible without using an external function to swap two values?

Do you want to do this for any particular reason? Don't bother for
efficency reasons, as any decent compiler will optimise away a call to a
swapping function if the swapping function is sufficently small.

[JKop]

> for integers only:

#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^

(a);}

I know this argument has been done to death but I'm going
to say it anyway:

swap(++i,k+=2);
....and that's just because I've declared war on macros.

ALL MACROS WILL SUFFER AND DIE A VERY PAINFUL DEATH, I WILL
SEE TO IT.

-JKop

[Gernot Frisch]

"JKop" <NU**@NULL.NULL> schrieb im Newsbeitrag
news:b7******************@news.indigo.ie...

for integers only:
#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^

(a);}

I know this argument has been done to death but I'm going
to say it anyway:

swap(++i,k+=2);
...and that's just because I've declared war on macros.

ALL MACROS WILL SUFFER AND DIE A VERY PAINFUL DEATH, I WILL
SEE TO IT.

Ah, c'mon. It's faster to write one that doing a function, but OK,
you're totally right.

template<class T> inline void swap(T&1, T&2)
{
(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^(a);
}

[Richard Herring]

In message <b7******************@news.indigo.ie>, JKop <NU**@NULL.NULL>
writes

for integers only:
#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^

(a);}

I know this argument has been done to death but I'm going
to say it anyway:

swap(++i,k+=2);

swap(a, a);

--
Richard Herring

[Richard Herring]

In message <2q*************@uni-berlin.de>, Gernot Frisch
<[e-mail]> writes

"JKop" <NU**@NULL.NULL> schrieb im Newsbeitrag
news:b7******************@news.indigo.ie...

for integers only:
#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^

(a);}

I know this argument has been done to death but I'm going
to say it anyway:

swap(++i,k+=2);
...and that's just because I've declared war on macros.

ALL MACROS WILL SUFFER AND DIE A VERY PAINFUL DEATH, I WILL
SEE TO IT.

Ah, c'mon. It's faster to write one that doing a function, but OK,
you're totally right.

template<class T> inline void swap(T&1, T&2)
{
(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^(a);
}

swap(a, a);
--
Richard Herring

[Karl Heinz Buchegger]

Gernot Frisch wrote:

"JKop" <NU**@NULL.NULL> schrieb im Newsbeitrag
news:b7******************@news.indigo.ie...

for integers only:
#define swap(a,b) {(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^

(a);}

I know this argument has been done to death but I'm going
to say it anyway:

swap(++i,k+=2);
...and that's just because I've declared war on macros.

ALL MACROS WILL SUFFER AND DIE A VERY PAINFUL DEATH, I WILL
SEE TO IT.

Ah, c'mon. It's faster to write one that doing a function, but OK,
you're totally right.

template<class T> inline void swap(T&1, T&2)
{
(a)=(b)^(a); (b)=(a)^(b); (a)=(b)^(a);
}

int i = 5;
swap( i, i );

-> i has a value of 0

--
Karl Heinz Buchegger
kb******@gascad.at

[Ioannis Vranos]

Hasan Ammar wrote:

Lets suppose we have a function to sort 3 integers, is it possible to
sort and return them in a single statement?

example:

bool sort(int a, int b, int c) {
return // this is where the code goes.... ;
}

is it possible without using an external function to swap two values?

What does it suppose to mean to "sort three integers, int a, int b, int c"?

--
Ioannis Vranos

http://www23.brinkster.com/noicys