forked from pn8rjlxip/System
				
			Merge pull request 'lyx.md' (#4) from pe4c6pn3v/System:master into master
	
		
	
				
					
				
			
						commit
						e0688b8782
					
				@ -0,0 +1,23 @@
 | 
				
			||||
void AsSortbyNum(STU stu[], int n, int m)
 | 
				
			||||
{
 | 
				
			||||
    int  i, j, k, t;
 | 
				
			||||
    for (i=0; i<n-1; i++)
 | 
				
			||||
    {
 | 
				
			||||
        k = i;
 | 
				
			||||
        for (j=i+1; j<n; j++)
 | 
				
			||||
        {
 | 
				
			||||
            if (stu[j].num < stu[k].num)    k = j;
 | 
				
			||||
        }
 | 
				
			||||
        if (k != i)
 | 
				
			||||
        {
 | 
				
			||||
            for (t=0; t<m; t++)          
 | 
				
			||||
              {
 | 
				
			||||
                   SwapFloat(&stu[k].score[t], &stu[i].score[t]);
 | 
				
			||||
            }
 | 
				
			||||
SwapFloat(&stu[k].sum, &stu[i].sum);  
 | 
				
			||||
SwapFloat(&stu[k].aver, &stu[i].aver);   
 | 
				
			||||
SwapLong(&stu[k].num, &stu[i].num);     
 | 
				
			||||
SwapChar(stu[k].name, stu[i].name);  
 | 
				
			||||
        }
 | 
				
			||||
    }
 | 
				
			||||
}
 | 
				
			||||
@ -0,0 +1,16 @@
 | 
				
			||||
void AverSumofEveryStudent(STU stu[], int n, int m)
 | 
				
			||||
{
 | 
				
			||||
	int i, j;
 | 
				
			||||
	for (i=0; i<n; i++)
 | 
				
			||||
	{
 | 
				
			||||
	    stu[i].sum = 0;
 | 
				
			||||
	    for (j=0; j<m; j++)
 | 
				
			||||
	    {
 | 
				
			||||
            stu[i].sum = stu[i].sum + stu[i].score[j];
 | 
				
			||||
	    }
 | 
				
			||||
	    stu[i].aver = m>0 ? stu[i].sum / m : -1;
 | 
				
			||||
	    printf("student %d: sum = %.0f, aver = %.0f\n", 
 | 
				
			||||
i+1, stu[i].sum, stu[i].aver);
 | 
				
			||||
	}	
 | 
				
			||||
}
 | 
				
			||||
 | 
				
			||||
@ -0,0 +1,27 @@
 | 
				
			||||
 | 
				
			||||
void StatisticAnalysis(STU stu[], int n, int m)
 | 
				
			||||
{
 | 
				
			||||
	int  i, j, t[6];
 | 
				
			||||
	for (j=0; j<m; j++)
 | 
				
			||||
	{
 | 
				
			||||
		printf("For course %d:\n", j+1);
 | 
				
			||||
	     memset(t, 0, sizeof(t)); 
 | 
				
			||||
		for (i=0; i<n; i++)
 | 
				
			||||
		{
 | 
				
			||||
			if (stu[i].score[j]>=0 && stu[i].score[j]<60)t[0]++;
 | 
				
			||||
			else if (stu[i].score[j]<70)				   t[1]++;
 | 
				
			||||
			else if (stu[i].score[j]<80)				   t[2]++;
 | 
				
			||||
			else if (stu[i].score[j]<90)				   t[3]++;
 | 
				
			||||
			else if (stu[i].score[j]<100)				   t[4]++;
 | 
				
			||||
			else if (stu[i].score[j] == 100)      		   t[5]++;
 | 
				
			||||
		}
 | 
				
			||||
		for (i=0; i<=5; i++)
 | 
				
			||||
		{
 | 
				
			||||
            if (i==0) printf("<60\t%d\t%.2f%%\n",t[i],(float)t[i]/n*100);
 | 
				
			||||
	       else if (i==5) printf("%d\t%d\t%.2f%%\n",
 | 
				
			||||
(i+5)*10,t[i],(float)t[i]/n*100);
 | 
				
			||||
	       else 	printf("%d-%d\t%d\t%.2f%%\n", 
 | 
				
			||||
(i+5)*10, (i+5)*10+9, t[i], (float)t[i]/n*100);	
 | 
				
			||||
		}
 | 
				
			||||
	}
 | 
				
			||||
}
 | 
				
			||||
					Loading…
					
					
				
		Reference in new issue