C++选择排序 「排序算法」

前言: 如果觉得好, 请评论“666”+点赞, 如果觉得还要改进, 请评论“888”

1、动画演示

 

2、模版

选择排序模版(从小到大):

#include <bits/stdc++.h>
using namespace std;
int a[1005]; 	
int main() {
	long long n; 
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i; i <= n-1; i++){
		int max = i;
		for (int j = i + 1; j <= n; j++) {
			if (a[j] < a[max]) {
				max = j;
			}
		}	
		swap(a[max], a[i]);
	}
	for (int i = 1; i <= n; i++) { 
		cout << a[i] << " ";
	}            
	return 0;
} 

输入样例:

5

3 7 2 9 4

输出样例:

2 3 4 7 9

选择排序模版(从大到小):

#include <bits/stdc++.h>
using namespace std;
int a[1005]; 	
int main() {
	long long n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i; i <= n-1; i++){
		int max = i;
		for (int j = i + 1; j <= n; j++) {
			if (a[j] > a[max]) {
				max = j;
			}
		}	
		swap(a[max], a[i]);
	}
	for (int i = 1; i <= n; i++) {
		cout << a[i] << " ";
	}            
	return 0;
} 

输入样例:

5

3 7 2 9 4

输出样例:

9 7 4 3 2

排序算法「选择排序, 冒泡排序,