递归算法

//递归算法判断数组递增或者递减 #include <stdio.h> #define BUFFERSIZE 10 //递增数组 bool recur_add(int array[], int size) { if(size <= 1) { return true; } if(array[size - 1] < array[size - 2]) { return false; } return recur_add(array, --size); } //递减数组 bool recur_sub(int array[], int size) { if(size <= 1) { return true; } if(array[size - 1] > array[size - 2]) { return false; } return recur_sub(array, --size); } int main(int argc, char* argv[]) { printf("Hello Recur !\n"); bool ret = false; int yx[BUFFERSIZE] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; int xy[BUFFERSIZE] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0}; ret = recur_add(yx, BUFFERSIZE); printf("recur_add %s!\n", ret ? "true" : "false"); ret = recur_sub(xy, BUFFERSIZE); printf("recur_sub %s!\n", ret ? "true" : "false"); return 0; }