Function Task(sum,div,search,swap,exchange)

#include<stdio.h>
int sum (int Number[10]);
int search(int Number[10]);
int maximum(int Number[10]);
int minimum(int Number[10]);
void swap(int*,int, int);
void exchange(int*,int,int);

int main()
{
    int Number[10] = {15,20,11,21,33,10,16,19,17,9};
    int Number2[10] = {15,20,11,21,33,10,16,19,17,9};
    int result = sum(Number);
    int index = search(Number);
    int result3 = maximum(Number);
    int result4 = minimum(Number);
    swap(Number,3,10);
    exchange (Number2,4,7);


    printf("Total amount of oranges on all of the boxes is: ");
    printf("%d\n",result);

    printf("33 Oranges found in box: %d\n",index);
    printf("Maximum Oranges found in box number: %d\n",result3);
    printf("Minimum Oranges found in box number: %d\n",result4);
    int i;
    printf("Swap Oranges Between 3rd & 10th Box: \n");
    for(i=0;i<10;i++)
    {
        printf("%d\t",Number[i]);
    }
    printf("\n\n");
    printf("Move Oranges form 4th to 7th box: \n");

    for(i=0;i<10;i++)
    {
        printf("%d\t",Number2[i]);
    }

    return 0;
}

int sum (int Number[10])
{
    int i,result=0;
    for(i=0;i<10;i++)
    {
        result = result + Number[i];
    }

    return result;
}

int search (int Number[10])
{
    int i,index;
    for(i=0;i<10;i++)
    {
        if(Number[i]==33)
        {
            index = i;
            break;
        }

    }
    index++;

    return index;

}

int maximum (int Number[10])
{
    int i;
    int max;
    max = Number[0];
    int result3;

    for(i=1;i<10;i++)
    {
        if(Number[i]>max)
        {
            max = Number[i];
        }
    }
    for(i=0;i<10;i++)
    {
        if(max == Number[i])
        {
            result3 = i;
            break;
        }
    }
    result3++;

    return result3;
}

int minimum (int Number[10])
{
    int i;
    int min;
    min = Number[0];
    int result4;

    for(i=1;i<10;i++)
    {
        if(Number[i]<min)
        {
            min = Number[i];
        }
    }
    for(i=0;i<10;i++)
    {
        if(min == Number[i])
        {
            result4 = i;
            break;
        }
    }
    result4++;

    return result4;
}
void swap (int *Number, int a, int b)
{
    int temp;
    temp = *(Number+(a-1));
    *(Number+(a-1)) = *(Number+(b-1));
    *(Number+(b-1)) = temp;

}
void exchange (int *Number2, int a, int b)
{
    int temp;
    temp = *(Number2+(a-1));
    *(Number2+(a-1))= 0;
    *(Number2+(b-1))= *(Number2+(b-1)) + temp;

}