冒泡排序
#include <iostream>
using namespace std;
int main() {
int arr[6] = { 0 };
int len = sizeof(arr) / sizeof(int);
for (int i = 0; i < len; i++) {
cin >> arr[i];
}
// write your code here......
for (int i = 0; i < len; i++)
{
for(int j = 0; j < len - 1 - i; j++)
{
if(arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i < len; i++) {
cout << arr[i] << " ";
}
return 0;
}
选择排序
#include <iostream>
using namespace std;
int main() {
int arr[6] = { 0 };
int len = sizeof(arr) / sizeof(int);
for (int i = 0; i < len; i++) {
cin >> arr[i];
}
// write your code here......
for (int i = 0; i < len; i++)
{
for(int j = i + 1; j < len; j++)
{
if(arr[i] > arr[j])
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
for (int i = 0; i < len; i++) {
cout << arr[i] << " ";
}
return 0;
}
标签:arr,temp,int,len,++,sizeof,排序
From: https://www.cnblogs.com/liubenben/p/17935816.html