
Andy C. answered 10/16/17
Tutor
4.9
(27)
Math/Physics Tutor
int isSorted( int a[], int n)
{
int iReturn=1;
for (int iLoop=0; iLoop<n-1; iLoop++)
{
if (a[iLoop]>a[iLoop+1])
{
iReturn = 0;
break;
}
}
return(iReturn);
}