一维数组元素排序方案

#include <iostream>
using namespace std;
int main() {
　　　　　//选择排序
int arr[] = { 58,69,48,16,25,17,89,64 };
int arrLen = sizeof(arr) / sizeof(int);
int temp = 0;
for (int i = 0; i < arrLen; i++) {
for (int j = i + 1; j < arrLen; j++) {
if (arr[i] > arr[j]) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for (int i = 0; i < arrLen; i++) {
cout << arr[i] << endl;
}
return 0;
}

　　　　　/*冒泡排序
int arr[] = { 58,69,48,16,25,17,89,64 };
int arrLen = sizeof(arr) / sizeof(int);
int temp = 0;
for (int i = 0; i < arrLen - 1; i++) {
for (int j = 0; j < arrLen - 1 - i;j++) {
if (arr[j] <arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i < arrLen; i++) {
cout << arr[i] << endl;
}
return 0;*/