1、冒泡排序(BubbleSortUp)
#include <iostream>
#include<algorithm>
using namespace std;
void BubbleSortUp(int arr[], int len) {
for (int i = 0; i < len - 1; i++) {
for (int j = 0; j < len - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
swap(arr[j], arr[j+1]);
}
}
}
}
int main() {
int arr[10] = { 1, 3, 15, 2, 4, 17, 8, 6, 9, 0 };
BubbleSortUp(arr, 10);
for (int i = 0; i < 10; i++) {
cout << arr[i] << ' ';
}
system("pause");
return 0;
}
2、选择排序(SelectionSort)
#include <iostream>
#include <algorithm>
using namespace std;
void selectionSort(int arr[], int n) {
for (int i = 0; i < n; i++) {
int minIndex = i;
for (int j = i + 1; j < n; j++)
if (arr[j] < arr[minIndex])
minIndex = j;
swap(arr[i], arr[minIndex]);
}
}
int main() {
int a[10] = { 10,9,8,7,6,5,4,3,2,1 };
selectionSort(a, 10);
for (int i = 0; i < 10; i++)
cout << a[i] << " ";
cout << endl;
system("pause");
return 0;
}