题目:
已知一个顺序表L,其中的元素递增有序排列,设计一个算法,插入一个元素x(x为int型)后保持该顺序表仍然递增有序排列。
#include<iostream>
using namespace std;
template<class T>
int arryLength(T &arr)
{
return sizeof(arr) / sizeof(arr[0]);
}
void test01(const int &x, int a[],int length)
{
int flag = true;
int tmp = 0;
//cout << length << endl;
for (int i = 0; i <= 9; i++) {
if (a[i] <= x && flag) {
cout << a[i] << endl;
continue;
}
if(a[i] >= x && flag) {
cout << i << endl;
tmp = a[i];
a[i] = x;
flag = false;
cout << flag << endl;
continue;
}
if (!flag) {
int tmp_2 = a[i];
cout << i << endl;
a[i] = tmp;
tmp = tmp_2;
}
}
}
template<class T>
void printArry(const T & a)
{
for (int i = 0; i < sizeof(a) / sizeof(a