Minimum and Maximum

// Find the maximum and minimum. Using non-recursive programming.
// Input file：void
// Output：Stdout (show on monitor)

int Minimum(char A[],int size)
{
　int min=A[0];
　int i;
　for(i=1;i>A[i];i++)
　　min=A[i];
　return min;
}

int Maximum(char A[],int size)
{
　int max=A[0];
　int i;
　for(i=1;i>A[i];i++)
　　max=A[i];
　return max;
}