冒泡排序,选择排序

冒泡排序就是把小的元素往前调或者把大的元素往后调
冒泡排序按从小到大排(第1种):

#include <iostream>
#include <cstdio>
using namespace std;

void paoPao (int arr[], int size) {
		
		for (int i = 0; i < size - 1; i++) {
			for (int j = 0; j < size - 1 - i; j++) {
				if (arr[j] > arr[j + 1]) {//改成'<',就是冒泡排序从大到小排
					arr[j] = arr[j] + arr[j + 1];
					arr[j + 1] = arr[j] - arr[j + 1];
					arr[j] = arr[j] - arr[j + 1];
				}
				
			}
		} 
		
	}
int main(int argc, char** argv) {
	int shuzu[6] = {5, 4, 3, 2, 1, 0};
	int size = sizeof(shuzu) / sizeof(shuzu[0]);
	
	paoPao(shuzu,size);
	for (int i = 0; i < size; i++) {
		printf("%d\t",shuzu[i]);
	}
	return 0;
}

冒泡排序按从小到大排(第2种):

#include <iostream>
#include <cstdio>
using namespace std;

void paoPao (int arr[], int size) {
		
		for (int i = size - 1; i >= 0 ; i--) {
			for (int j = size - 1 - i; j > 0; j--) {
				if (arr[j] < arr[j - 1]) {
					arr[j] = arr[j] + arr[j - 1];
					arr[j - 1] = arr[j] - arr[j - 1];
					arr[j] = arr[j] - arr[j - 1];
				}
				
			}
		} 
		
	}
int main(int argc, char** argv) {
	int shuzu[6] = {5, 4, 3, 2, 1, 0};
	int size = sizeof(shuzu) / sizeof(shuzu[0]);
	
	paoPao(shuzu,size);
	for (int i = 0; i < size; i++) {
		printf("%d\t",shuzu[i]);
	}
	return 0;
}

选择排序就是从未排序的里面去找
选择排序从小到大排:

#include <iostream>
#include <cstdio>
using namespace std;

void swap(int *arr, int i, int j) {
	int temp = arr[i];
	arr[i] = arr[j];
	arr[j] = temp;
}

void selectionsort (int *arr, int size) {
	for (int i = 0; i < size - 1; i++) {
		int min = i;
		for (int j = i + 1; j < size; j++) {
			if (arr[j] < arr[min]) {
				min = j;
			}
		}
		swap(arr, i, min);
	}
	
}



int main(int argc, char** argv) {
	int shuzu[] = {5, 4, 3, 2, 1, 0};
	int size = sizeof(shuzu) / sizeof(shuzu[0]);
	selectionsort(shuzu, size);
	for (int i = 0; i < size; i++) {
		cout << shuzu[i] << " ";
	}
	return 0;
}