voidLoveYou(int n)//n为问题的规模{int i=1;//爱你的程度while(i<=n){
i++;printf("I Love You %d\n",i);}printf("I Love You More Than %d\n",n);}intmain(){LoveYou(2000);system("pause");return0;}
算法2 嵌套循环型爱你
voidLoveYou(int n)//n为问题的规模{int i=1;//爱你的程度while(i<=n){
i++;printf("I Love You %d\n",i);for(int j=1;j<=n;j++){printf("I Am Iron Man\n");}}printf("I Love You More Than %d\n",n);}intmain(){LoveYou(2000);system("pause");return0;}
算法3 指数递增型爱你
voidLoveYou(int n)//n为问题的规模{int i=1;//爱你的程度while(i<=n){
i=i*2;printf("I Love You %d\n",i);}printf("I Love You More Than %d\n",n);}intmain(){LoveYou(2000);system("pause");return0;}
算法4 搜索数字型爱你
1.voidLoveYou(int flag[],int n)2.{3.printf("I Am Iron Man\n");4.for(int i=0;i<n;i++)5.{6.if(flag[i]==n)7.{8.printf("I Love You %d\n",n);9.break;10.}11.}12.}13.intmain()14.{15.int flag[n]={1,2,};16.LoveYou(flag,n);17.system("pause");18.return0;19.}
1.2_2算法的时间复杂度算法一 逐步递增型爱你void LoveYou(int n)//n为问题的规模{ int i=1;//爱你的程度 while(i<=n) { i++; printf("I Love You %d\n",i); } printf("I Love You More Than %d\n",n); }int main(){ LoveYou(2000); system("pause"); return 0;}算法2 嵌套循环型爱你void