Practice:sort scores with student numbers.

#include<stdio.h>
#define n 5
void sort1(int score[],int num[],int cnt);
void sort2(int score[],int num[],int cnt);
void sort3(int score[],int num[],int cnt);
int main(void){
	int i,score[n],num[n];
	for(i=0;i<n;i++) {
		num[i]=i;
		scanf("%d",&score[i]);
	}
	sort1(score,num,n);
	for(i=0;i<n;i++) printf("number%d:%d\n",num[i]+1,score[i]);
	return 0;
}
void sort1(int score[],int num[],int cnt){
	int i,j,min,t;
	for(i=0;i<cnt-1;i++){
		min=i;                                        
		for(j=min+1;j<cnt;j++){
			if(score[j]<score[min]) min=j;
		}
		t=score[i];score[i]=score[min];score[min]=t;
		t=num[i];num[i]=num[min];num[min]=t;
	}
}
void sort2(int score[],int num[],int cnt){
	int i,flag,t;
	flag=1;
	while(flag){
		flag=0;
		for(i=0;i<cnt-1;i++){
			if(score[i]>score[i+1]){
				flag=1;
				t=score[i];score[i]=score[i+1];score[i+1]=t;
				t=num[i];num[i]=num[i+1];num[i+1]=t;
			}
		}
void sort3(int score[],int num[],int cnt){
	int i,r,j,t,k;
	for(i=1;i<cnt;i++){
		j=i-1;
		while(score[j]>score[i]&&j>=0){
			j--;
		}
		r=score[i];
		t=num[i];
		for(k=i-1;k>=j+1;k--){
			score[k+1]=score[k];
			num[k+1]=num[k];
		}
		score[j+1]=r;
		num[j+1]=t;
	}
}