중위수구하기/조현태

~cpp 
#include <iostream>

using namespace std;

const int MAX_NUMBER=3;
const int BREAK_NUMBER=-999;

void change(int *number1, int *number2)
{
	int temp=*number1;
	*number1=*number2;
	*number2=temp;
}

int input(int *input_number)
{
	for (int i=0; i<MAX_NUMBER; ++i)
	{
		cout << i+1 << "������ ��������� ������해 ���������.";
		cin >> input_number[i];
		if (0==i && input_number[0]==BREAK_NUMBER)
			return 0;
	}
	return 1;
}

void main()
{
	int input_number[MAX_NUMBER]={0,};
	while (input(input_number))
	{
		for (int i=0; i<MAX_NUMBER-1; ++i)
		{
			for (int j=0; j<MAX_NUMBER-i-1; ++j)
			{
				if (input_number[j]>input_number[j+1])
					change(&input_number[j],&input_number[j+1]);
			}
		}
		cout << "��������� ������ " << input_number[MAX_NUMBER/2] << "���������.\n";
	}
}