几个递归练习

1.反向输出字符串

void stringReverse( char array[] )

void printArray( int array[], int size )

int recursiveMinimum( int array[], int size )

2void selectionSort( int list[], int n, int start)

2int linerSearch(int a[], int key, int size)

2{

3 if ( size > 0 )

4 {

5 if ( a[ size - 1 ] == key )

6 return size - 1; //反方向,返回下标

7 return linerSearch( a, key, size - 1 );

8 }

9

return -1; //未找到

}