OJ.616.排序查找

15

23 32 43 54 65 65 78 87 98 87 76 76 76 55 65

87 

--------------

98 87 87 78 76 76 76 65 65 65

55 54 43 32 23

2 

-------------

#include <stdio.h>
#include <stdlib.h>
int main()
{
    void paixu(int a[],int numstudent);
    int reserch(int a[],int grade,int numstudent);
    int N;
    int i,t;
    int grade[55];
    int score; 
    scanf("%d",&N);
    for(i=1;i<=N;i++)
    {
        scanf("%d",&grade[i]);
    }
    scanf("%d",&score);
    paixu(grade,N);
    for(i=1;i<N;i++)
    {   
        if(i%10!=0)
        printf("%d ",grade[i]);
        if(i%10==0 && i==N-1)
        {
            printf("%d",grade[i]);
            continue;
        }
        if(i%10==0)
        {
            printf("%d\n",grade[i]);    
        }
    }
    printf("%d",grade[i]);
    printf("\n");
    if(reserch(grade,score,N)==0)   
    {
        printf("no this score!\n");
    }
         
    else
        printf("%d\n",reserch(grade,score,N));
     
    return 0;
}
void paixu(int a[],int student)
{
    int i,j;
    int t;
    for(i=1;i<student;i++)
    {
        for(j=i;j<=student;j++)
        {
            if(a[i]<=a[j])
            {
                t=a[i];
                a[i]=a[j];
                a[j]=t;
            }
        }
         
    }
}
int reserch(int num[],int score,int numstudent)
{
    int i;
    for(i=1;i<=numstudent;i++)
    {
        if(num[i]==score)
        {
            return i;
        }
        if(i==numstudent)
            return 0;
    }
     
}