冒泡排序

来源:互联网 发布:剑指offer python 编辑:程序博客网 时间:2024/06/17 14:38
//Geeksun 2017.11.26
#include <stdio.h>
#include <string.h>
int main()
{
    int score[100],n,i,j,temp;
    while(scanf("%d",&n) != EOF)
    {
        for(i = 0;i < n;i++)
        {
            scanf("%d",&score[i]);
        }
        for(i = 0;i < n - 1;i++)
        {
            for(j = 0;j < n - i - 1;j++)
            {
                if(score[j] < score[j + 1])
                {
                     temp = score[j];
                     score[j] = score[j + 1];
                     score[j + 1] = temp;
                }
            }
        }
    printf("%d",score[0]);
    memset(score,0,sizeof(score));
    }
    return 0;
}

原创粉丝点击