void init(int arr[], int size) { for (int i = 0; i < size; i++) { arr[i] = 0; } }

void print(int arr[], int size) { for (int j = 0; j < size; j++) { printf("%d ", arr[j]); } printf("\n"); }

void reverse(int arr[], int size) { int left = 0; int right = size - 1; while (left < right) { int temp = arr[left]; arr[left] = arr[right]; arr[right] = temp; left++; right--; } }

int main() { int arr[10] = {10, 1, 35, 30, 40, 44, 56, 97, 68, 82}; int size = sizeof(arr) / sizeof(arr[0]);

printf("原数组：");
print(arr, size);
reverse(arr, size);
printf("逆置后：");
print(arr, size);
init(arr, size);
printf("初始化后：");
print(arr, size);
return 0;

}