問題: 數組逆序,將一維數組a中的n個數逆序存放在原數組中. int n = 10;int a[10] = {1,2,3,4,5,6,7,8,9,10};//算法實現(1) ,僅僅通過借助一個臨時變量temp,與問題規(guī)模n大小無關,所以其空間復雜度為O(1);int temp;for(int i = 0; i < n/2 ; i++){??temp = a[i];??a[i] = a[n-i-1];??a[n-i-1] = temp;}for(int i = 0;i < 10;i++){??printf("%d\n",a[i]);}//算法實現(2) 借助一個大小為n的輔助數組b,所以其空間復雜度為O(n)int b[10] = {0};for(int i = 0; i < n;i++){??b[i] = a[n-i-1];}for(int i = 0; i < n; i++){??a[i] = b[i];}for(int i = 0;i < 10;i++){??printf("%d\n",a[i]);}