• 桶排序-C-结构体排序


        struct TS {
            int index;
            char name[10];
        };
        
        struct TS b[5] = {{5,"s5"},{2,"s2"},{3,"s3"},{1,"s1"},{8,"s8"}};
        
        struct TS a[11];
        int i;
        int length = sizeof(a) / sizeof (struct TS);
        for(i=0;i<length;i++){
            struct TS tmp = {0,""};
            a[i] = tmp;
        }
        
        for (i=0; i<5; i++) {
            int num = b[i].index;
            if(a[num].index >= 0){
                a[num] = b[i];
            }else{
                struct TS tmp = {0,""};
                a[num] = tmp;
            }
        }
        
        for (i=0; i<11; i++) {
            if(a[i].index)
                printf("%s
    ",a[i].name);
        }
  • 相关阅读:
    点子
    点子
    ruby crawler Anemone
    创业站
    我友网 没前途
    创意
    电商站
    尿布
    创意
    青番茄好项目
  • 原文地址:https://www.cnblogs.com/levy/p/5896714.html
Copyright © 2020-2023  润新知