Ãë´óµ¶ ²©¿Í

//1_16
/*
  Name: 1_16 
  Copyright: Ãë´óµ¶ 
  Author: Ãë´óµ¶ 
  Date: 24-02-05 22:27
  Description: ÊÔдһ¸öËã·¨£¬×Ô´óÖÁСÒÀ´ÎÊä³ö˳Ðò¶ÁÈëµÄÈý¸öÕûÊýX¡¢YºÍZµÄÖµ¡£ 
  Algorithm description:ÀûÓÃÈý´Î±È½ÏµÃ³ö½á¹û
*/
struct num3
{
    int first,second,third;
};
num3 sort3(const num3&  In)
{
    num3 Out;
    if(In.first>In.second)
    {
        Out.first=In.first;
        Out.third=In.second;
    }
    else
    {
        Out.first=In.second;
        Out.third=In.first;
    }
    //Until now,Out.first>Out.third
    if(Out.third<In.third)
    {
        Out.second=In.third;
    }
    else
    {
        Out.second=Out.third;
        Out.third=In.third;
    }
    //Until now,the min is in Out.third
    if(Out.first>Out.second)
    {
        return Out;//We have got the answer.
    }
    else
    {//Swap Out.first and Out.second.
        int temp=Out.first;
        Out.first=Out.second;
        Out.second=temp;
    }
    return Out;//At last we make it.
  
}
//The next is test code:
#include<iostream>
using namespace std;
int main()
{
    while(1)
    {
            cout<<"ÇëÊäÈëÈý¸öÊý£º"<<std::flush; 
            num3 In;
            cin>>In.first>>In.second>>In.third;
            num3 Out=sort3(In);
            cout<<endl<<In.first<<','<<In.second <<','<<In.third<<"----SORT---->"
              <<Out.first<<','<<Out.second<<','<<Out.third<<endl<<endl;
    }
 return 0;
}