zoukankan      html  css  js  c++  java
  • 排序

    #include<stdio.h>
    #include<string.h>
    struct Student{                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                       
     char name[10];
     char sex[5];
     double grade; 
     };
     int main(void){
     struct Student student[10];
     int i,j;
     struct Student temp;
     for(i=0;i<10 ;i++){
      printf(" 请输入第%d个学生的信息: ",i+1);
      printf("姓名");
      char a[10];
      scanf("%s",&a);
      strcpy(student[i].name,a);
      printf(" 性别");
      char b[10];
      scanf("%s",&b);
      strcpy(student[i].sex,b);
      printf(" 成绩");
      scanf("%lf",&student[i].grade);
     }
     for(i=0;i<10;i++){
       for(j=i+1;j<10;j++){
       if(student[i].grade>student[j].grade){
       temp=student[i];
       student[i]=student[j];
       student[j]=temp;
       }
       }
     }
     for(i=0;i<10;i++){
     printf("%s %s %lf",student[i].name,student[i].sex,student[i].grade);
     }
     }

  • 相关阅读:
    hash和history的区别帮助向我一样迷的人弄明白,history和hash
    调用谷歌浏览器的打印所遇到的困难,回流重绘
    webpack简单搭建基础感悟
    linux
    介绍一下call,apply,bind方法实现,源于MDN中的bind
    二进制流转base64加快速度
    手写一个instanceof
    青蛙跳台阶问题
    Django中vue的使用
    pip install 出现 timeout 时的两个临时解决办法
  • 原文地址:https://www.cnblogs.com/jiafangfang/p/6062209.html
Copyright © 2011-2022 走看看