/**
 * Copyright (c) 2001,2002 Yoon, Hyunho <hhyoon@kldp.org>
 * http://mooo.org
 * ----------------------------------------------------------------------
 *
 * LICENSE
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software 
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */
#include <stdio.h>
int sum_array(int *array, int num);
int main()
{    int array[10] = { 1, 2, 3, 4, 10, 6, 7, 8, 9, 10 };
    int sum;
    sum = sum_array(array, 10);
    printf("Sum of the array is %d\n", sum);
    return 0;
}int sum_array(int *array, int num)
{    int i, sum = 0;
    for (i = 0; i < num; i++)
        sum += array[i];
    return (sum);
}
이 작은숲 문서의 출처는 위키노트의 위키노트/C 언어 예제/배열합 구하는 함수 문서입니다.