#include iostream
#include <cmath
#include <iomanip
#include <windows.h
#include <cstdlib
#include <string
#include <ctime
#include <vector
#include <algorithm //sort算法的头文件
using namespace std;
int main() {
int arrays[]{ 15,23,30,40,50 };
int* p_arrays = arrays;
//顺序输出
for (int i = 0; i < 5; i++) {
cout << *(p_arrays + i) << endl;
}
//倒序
int *ptr_start = arrays;
int *ptr_end = arrays+4;
int temp;
while (ptr_start != ptr_end) {
temp = *ptr_start;
*ptr_start = *ptr_end;
*ptr_end = temp;
ptr_start++;
ptr_end--;
}
for (int i = 0; i < 5; i++) {
cout << arrays[i] << endl;
}
getchar();
return 0;
//int num = 90;
//double d_nums[6] = { 3,4,5,6 };
/*int num[5];
int* nums = new int[5];
cout << sizeof(num) << '\t' << sizeof(nums) << endl;
int* intArray = new int[10];
delete[] intArray;
getchar();
return 0;*/
}