- 最后登录
- 2018-10-14
- 金钱
- 3393
- 注册时间
- 2013-10-12
- 阅读权限
- 180
- 帖子
- 15680
- 精华
- 0
- 积分
- 43571
院士
学挖掘机哪家强???
|
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
bool insert(int a[], int& length, int max, int position, int val);
void print(int a[],int n);
int main(){
int a[6],n=3;
a[0]=4;
a[1]=3;
a[2]=8;
print(a,n);
cout<<"insert(a,n,7,0,12)\n";
if(insert(a,n,7,0,12))
cout<<"return true\n";
else
cout<<"return false\n";
print(a,n);
cout<<"insert(a,n,7,9,22)\n";
if(insert(a,n,7,9,22))
cout<<"return true\n";
else
cout<<"return false\n";
print(a,n);
cout<<"insert(a,n,7,2,23)\n";
if(insert(a,n,7,2,23))
cout<<"return true\n";
else
cout<<"return false\n";
print(a,n);
cout<<"insert(a,n,7,n+1,25)\n";
if(insert(a,n,7,n+1,25))
cout<<"return true\n";
else
cout<<"return false\n";
print(a,n);
cout<<"insert(a,n,7,n-1,26)\n";
if(insert(a,n,7,n-1,26))
cout<<"return true\n";
else
cout<<"return false\n";
print(a,n);
cout<<"insert(a,n,7,n,20)\n";
if(insert(a,n,7,n,20))
cout<<"return true\n";
else
cout<<"return false\n";
print(a,n);
system("pause");
return 0;
}
void print(int a[],int n)
{int i;
for(i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl<<"n="<<n<<endl;
}
bool insert(int a[], int& length, int max, int position, int val){
int x = 0;
if (length + 1 > max){
return false;
}
if (position < 0 || position > length ){
return false;
}
for (x = length; x >=position; x--){
a [ x ] = a [ x-1 ];
}
a [ position ] = val;
length++;
return true;
} |
评分
-
查看全部评分
|