递归思想

 1 // Function to reverse arr[] from start to end
 2 // 递归思想!!!
 3 void rvereseArray(int arr[], int start, int end)
 4 {
 5     if (start >= end)//递归边界
 6         return;
 7 
 8     //交换操作：给出去的立即被给
 9     int temp = arr[start];
10     arr[start] = arr[end];
11     arr[end] = temp;
12 
13     // Recursive Function calling
14     rvereseArray(arr, start + 1, end - 1);
15 }