判断整形数组是按升序还是降序排列的,采用递归的方法
#include <stdio.h>
int isascending(int *p,int n)
{
if(p == NULL)
{
return -1;
printf("the arrary is NULL,please check it\n");
}
//判断n的个数
if(n&0xfffffffe)
{
if(p[n-1]<p[n-2])
{
return -1;
}
else
{
return isascending(p,n-1);
}
}
else
{
return 1;
}
}
int main(int argc,char *argv[])
{
int p[]={12,233,43,124};
int a = isascending(p,sizeof(p)/sizeof(int));
printf("the result is %d\n",a);
getchar();
return 0;
}