quantum

摘要： #include<iostream>using namespace std;const int n=10;void output(int flist[],int list[],int n);void pigeon_hole(int flist[],int list[],int n); int main(){ int list[n]; int flist[n]; for(int i=0;i<n;++i){ list[i]=i%5; } output(flist,list,n); pigeon_hole(flist,list,n); retu... 阅读全文

摘要： #include<iostream>using namespace std;int asending(int &x,int &y);int main(){ cout<<"输入数字x=： "; int x; cin>>x; cout<<"输入数字y=： "; int y; cin>>y; cout<<"输入数字z=： "; int z; cin>>z; while(asending(x,y)==0){ if(z<=x) cout&l 阅读全文

摘要： #include<iostream>using namespace std;void truth_table(int n);int main(){ cout<<"n:(>=0): "; int n; cin>>n; while (n <= 0){ /*error loop */ cout<<"n:(>=0): "; cin>>n; } truth_table(n); return 0;}void truth_table(int n){/* generate a truth_ta 阅读全文

摘要： #include<iostream>const int coef_num=5;using namespace std;template<typename T> inline T horner(T x,T index,T coef,T list[]);int main(){ int list[coef_num]={1,2,1,3,6}; cout<<"输入未知数 x= "; int x; cin>>x; int sum=horner(x,coef_num-1,list[4],list); cout<<"Ho 阅读全文

摘要： #include<iostream>const int coef_num=5;using namespace std;template<typename T> inline T horner(T x,T n,T list[]);int main(){ int list[coef_num]={1,2,1,3,6}; cout<<"输入未知数 x= "; int x; cin>>x; int sum=horner(x,coef_num,list); cout<<"Horner函数值： "<&l 阅读全文

摘要： #include<iostream>using namespace std;const int list_size=4;void perm(char list[],int i,int n);int main(){ char list[list_size]={'a','b','c','d'}; perm(list,0,list_size-1); return 0;}void perm(char list[],int i,int n){ if(i==n){ for(int j=0;j<=n;j++) cout< 阅读全文

摘要： #include<iostream> using namespace std;const int list_size=10;int binsearch(int list[],int searchnum,int left,int right);int compare(int x,int y);int main(){ int list[]={1,2,3,5,7,8,9,12,15,18}; cout<<"输入要查找的数： "; int seanum; cin>>seanum; int suc=binsearch(list,seanum,0,l 阅读全文

摘要： #include<iostream>using namespace std;const int list_size=10;int binsearch(int list[],int searchnum,int left,int right);int compare(int x,int y);int main(){ int list[]={1,2,3,5,7,8,9,12,15,18}; cout<<"输入要查找的数： "; int seanum; cin>>seanum; int suc=binsearch(list,seanum,0,li 阅读全文

摘要： #include<iostream>#include<ctime>using namespace std;const int max_size=100;template<typename T> inline void SWAP(T &x,T &y);void sort(int *list);int main(){ int list[max_size]; srand(time(NULL)); for(int i=0;i!=max_size;++i){ list[i]=rand()%1000; } for(int i=0;i!=max_size; 阅读全文