U E D R , A S I H C RSS

중위수구하기/허아영



~cpp 
#include <stdio.h>

int search_middleNum(int *, int *, int *);
void changeXY(int *, int *);
void main()
{
	int a, b, c, middleNum;
	while(1){
		printf("멈면 '-999 0 0' \n");
		printf(" A, B, C    : ");
		scanf("%d %d %d", &a, &b, &c);
		if(a == -999){
			break;
		}
		middleNum = search_middleNum(&a, &b, &c);
		printf(" = %d", middleNum);
	}
}

int search_middleNum(int *a, int *b, int *c)
{
	int middle;
	if(*a >= *b){changeXY(a, b);};
	if(*a >= *c){changeXY(a, c);};
	if(*b >= *c){changeXY(b, c);};
	middle = *b;
	return middle;
}

void changeXY(int *x, int *y)
{
	int temp;
	temp = *x;
	*x = *y;
	*y = temp;
}

만들 보면.
a b c
. 45 14 38
if(*a >= *b){changeXY(a, b);} 14 45 38
if(*a >= *c){changeXY(a, c);} 14 45 38
if(*b >= *c){changeXY(b, c);} 14 38 45

*b를 .


..
A
~cpp 
		middleNum = search_middleNum(&a, &b, &c);
		printf(" = %d", middleNum);

B
~cpp 
                  printf(" = %d", search_middleNum(&a, &b, &c));
데..^^
int search_middleNum(int *a, int *b, int *c) ..
데..ㅎㅎㅎ ..ㅎㅎ 문 ..^^
.. 뭐 ~ ..^^ -

? ?^^ -
└ㅎㅎㅎㅎㅎ ?? ㅎㅎ .ㅎㅎ ..^^ !! CC는 ....ㅎㅎ
.. ! 부럽냐~ . -
└ㅎㅎ 무리 .....런데 ? ㅎㅎㅎ 들..ㅎㅎ -
. A 를 B 메모리 , . 만 A를 B. 만 running time 면, . -- 보
는데 -;;;; ;; -

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:31:09
Processing time 0.0133 sec