排序

排序

#include <stdio.h>
#define N 40

int ReadScore(int score[]);
void PrintScore(int score[],int n);
void AscendingSort(int a[],int n);
void DescendingSort(int a[],int n);
void Swap(int *x,int *y);

int main()
{
	int score[N],n;
	int order;
	n = ReadScore(score);
	printf("Total students are %d\n",n);
	printf("Enter 1 to sort in ascending order,\n");
	printf("Enter 2 to sort in descending order:");
	scanf("%d",&order);
	printf("Data items in original\n");
	PrintScore(score,n);
	if(order==1)
	{
		AscendingSort(score,n);
		printf("data items in ascending order\n");
	}
	else
	{
		DescendingSort(score,n);
		printf("Data items in descending order\n");
	}
	PrintScore(score,n);
	return 0;
}

int ReadScore(int score[])
{
	int i=-1;
	do{
		i++;
		printf("Input score:");
		scanf("%d",&score[i]);
	}while(score[i]>=0);
	return i;
}

void PrintScore(int score[],int n)
{
	int i;
	for(i=0;i<n;i++)
	{
		printf("%4d",score[i]);
	}
	printf("\n");
}

void AscendingSort(int a[],int n)
{
	int i,j,k;
	for(i=0;i<n-1;i++)
	{
		k=i;
		for(j=k+1;j<n;j++)
		{
			if(a[j]<a[k])
			{
				k=j;
			}
		}
		if(k!=i)
		{
			Swap(&a[k],&a[i]);
		}
	}
}

void DescendingSort(int a[],int n)
{
	int i,j,k;
	for(i=0;i<n-1;i++)
	{
		k=i;
		for(j=k+1;j<n;j++)
		{
			if(a[j]>a[k])
			{
				k=j;
			}
		}
		if(k!=i)
		{
			Swap(&a[k],&a[i]);
		}
	}
}

void Swap(int *x,int *y)
{
	int temp;
	temp = *x;
	*x = *y;
	*y = temp;
}