新学的两种排序方法

最新推荐文章于 2024-07-21 16:48:07 发布

a2779586403

最新推荐文章于 2024-07-21 16:48:07 发布

阅读量226

点赞数

分类专栏： c基础

本文链接：https://blog.csdn.net/a2779586403/article/details/52274535

版权

c基础专栏收录该内容

0 篇文章 0 订阅

订阅专栏

#include<stdio.h>
int main(){
	int aScores[5] = { 0, 1, 2, 3, 4 };
	int max=0;
	int min=0;
	int i ;
	int j;
	int t;
	/*

	for (int i = 0; i < 5; i++){

		printf("aScores[%d]=%d\n", i,aScores[i]);

	}*/

	/*
	for (int i=0; i < 5; i++){
		if (aScores[i] < max){
			max = aScores[i];
		}
		if (aScores[i] > min){

			min = aScores[i];

		}
	

	}

	printf("%d\n%d\n", min, max);

*/

//选择排序法，与每个比较，5次

>	for (i = 0; i < 5; i++){</span>

		for (j = i; j < 5; j++){

			if (aScores[j] > aScores[i]){
				t = aScores[i];
				aScores[i] = aScores[j];
				aScores[j] = t;

			}
		}
		printf("%d\n", aScores[i]);

	}*/

//冒泡排序，相邻两个之间比较，换位
	for (i = 0; i < 4; i++){

		for (j = 0; j < 4 - i; j++){
			if (aScores[j] > aScores[j + 1]){

				t = aScores[j+1];
				aScores[j+1] = aScores[j];
				aScores[j] = t;

			}



		}
		
	}
	
	for (i = 0; i < 5; i++){


		printf("%d\n", aScores[i]);


	}

	return 0;
}