응용프로그래밍 족보 - 이중 포인터, 배열 sum, 최대값,최소값,이진화,반전

소개글

"응용프로그래밍 족보 - 이중 포인터, 배열 sum, 최대값,최소값,이진화,반전"에 대한 내용입니다.

목차

없음

본문내용

1.
// 이중 포인터 프로그램
#include <stdio.h>
void set_proverb(char **q, int n);
int main(void)
{
char *s = NULL;
int n;
printf("몇번째 속담을 선택하시겠습니까?");
scanf("%d", &n);
set_proverb(&s, n);
printf("selected proverb = %s\n",s);
return 0;
}
void set_proverb(char **q, int n)
{
static char *array[10]={"A bad shearer never had a good sickle.",
"A bad workman (always) blames his tools. ",
"A bad workman quarrels with his tools.",
"A bad thing never dies.",
"A bad workman finds fault with his tools.",
"A bad workman always blames his tools.",
"A bargain is a bargain.",
"A barking dog never bites.",
"A barking dog was never a good hunter."};
*q = array[n];
}

2.
#include <stdio.h>
int get_sum(int array[], int size);
int main(void)
{
int m[][1]= { 1, 1, 1 };
int result = get_sum(m[0], 1);
printf("%d\n", result);
return 0;
}
int get_sum(int array[], int size)
{
int i=0;
int sum=0;
for(i=0;i<size; i++)
sum += array[i];
return sum;
}

참고 자료

없음