排序

#include <stdio.h>
#define  M   40
#define  N   11
int main()
{         
    int  i, j, grade, feedback[M], count[N] = {0};
    printf("Input the feedbacks of 40 students:\n");
    for (i = 0; i < M; i++)
    {         
        scanf("%d", &feedback[i]);
    }
    for (i = 0; i < M; i++)
    {         
        switch (feedback[i])
        {         
        case 1:
            count[1]++;
            break;
        case 2:
            count[2]++;
            break;
        case 3:
            count[3]++;
            break;
        case 4:
            count[4]++;
            break;
        case 5:
            count[5]++;
            break;
        case 6:
            count[6]++;
            break;
        case 7:
            count[7]++;
            break;
        case 8:
            count[8]++;
            break;
        case 9:
            count[9]++;
            break;
        case 10:
            count[10]++;
            break;
        default:
            printf("input error!\n");
            break;
        }
    }
    printf("Feedback\tCount\tHistogram\n");
    for (grade = 1; grade <= N - 1; grade++)
    {         
        printf("%8d\t%5d\t", grade, count[grade]);
        for (j = 0; j < count[grade]; j++)
        {         
            printf("%c", '*');
        }
        printf("\n");
    }
    return 0;
}  
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值