C++实训（2.4）

源程序：

#include <iostream>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
const int MAXSIZE = 10;
using namespace std;

int* InitArray()
{
int i;
int* p = new int[10];
for (i = 0; i < 10; i++)
p[i] = -1; //给数据中的每个元素初始化为-1
return p;
}

//逆序打印
void reverse(int b[])
{
for (int i = 0; i < MAXSIZE/2; i++)
{
int temp;
temp = b[i];
b[i] = b[MAXSIZE - 1 - i];
b[MAXSIZE - 1 - i] = temp;
}
}
//在数组中查找值为k的元素
int search(int A[], int n, int k)
{
int i = 0;
while (i < n)
{
if (A[i] != k)
i++;
else
break;
}
return i;
}

int main()
{
int a[10] = {34,5,8,12,35,69,40,33,19,28};
int *b = InitArray();
int i;
for (i = 0; i < 10; i++)
b[i] = a[i];
cout << "数组中的数为：" << endl;
for (i = 0; i < 10; i++)
cout << setw(4) << a[i];
cout << endl;

cout << "逆序输出数组：" << endl;
reverse(b);

for (i = 0; i < MAXSIZE; i++)
cout << setw(4) << b[i];
cout << endl;

int x;
cout << " 在数组中查找一个数，若找到显示其位置，没找到则显示-1" << endl;
cout << "请输入要查找的数：";
cin >> x;
int pos = search(a,10,x);
if (pos < 10)
cout << "这个数的位置是：" << pos + 1 << endl;
else
cout << "-1 没有此数！" << endl;
system("pause");
return 1;
}

运行结果：