12月7日 循环与数组

1.求最大值和最小值

#include <stdio.h>

int main(int argc, const char *argv[])

{

      double arr[5];

      double max=0,min=0;

      int i,m,n;

      for(i=0;i<5;i++){

           scanf("%lf",&arr[i]);

      }

      max=arr[0];min=arr[0];

      i=0;n=0;

      for(i=1;i<5;i++){

           if(max<arr[i]){

                 max=arr[i];

                 m=i;

           }

           if(min>arr[i]){

                 min=arr[i];

                 n=i;

           }

      }

      printf("最大值为%.2lf,位置为第%d\n",max,m+1);

      printf("最小值为%.2lf,位置为第%d\n",min,n+1);

      return 0;

}

2. 输入数组元素，并将元素排序

#include <stdio.h>

int main(int argc, const char *argv[])

{

      int n,i,j,k,temp,count,l;

      printf("请输入数组长度\n");

      scanf("%d",&n);

      int arr[10];

      for(i=0;i<n;i++){

           scanf("%d",&arr[i]);

      }

      for(j=1;j<n;j++)

      { 

           count=0;

           for(k=0;k<n-j;k++)

           {

                 if(arr[k]<arr[k+1]){

                      temp=arr[k+1];

                      arr[k+1]=arr[k];

                      arr[k]=temp;

                      count++;

                 }

           }

           if(count==0)

           {

                 break;

           }

      }

      for(l=0;l<n;l++){

           printf("\n%d",arr[l]);

      }

      return 0;

}

3.打印斐波那契数列

#include <stdio.h>

int main(int argc, const char *argv[])

{

      int i,n;

      int arr[100];

      printf("请输入项数");

      scanf("%d",&n);

      for(i=0;i<n;i++){

           if(i==1||i==0){

                 arr[i]=1;

           }

           else{

                 arr[i]=arr[i-1]+arr[i-2];

           }

      }

      for(i=0;i<n;i++){

           printf("%d\n",arr[i]);

      }

      return 0;

}

4.杨辉三角形

#include <stdio.h>

int main(int argc, const char *argv[])

{

      int i,j,k;

      int arr[50][50];

      for(i=0;i<8;i++){

           for(j=0;j<i;j++){

                 if(j==0||i==j)

                      arr[i][j]=1;

                 else{

                      arr[i][j]=arr[i-1][j]+arr[i-1][j-1];

                 }

           }

      }

    for(i=0;i<8;i++){

                for(j=0;j<8-i;j++)

                 {

                      printf("  ");

                 }

                 for(j=0;j<i;j++)

                 {

                      printf("%d  ",arr[i][j]);

            }

                 printf("\n");

            }

      return 0;

}