#include<iostream>
using namespace std;void selectsort(int arr[], int n)
{
int i, j, tmp;
for (i = 0;i < n - 1;i++)
{
for (j = 1;j < n;j++)
{
if (arr[j - 1] > arr[j])
{
tmp = arr[j-1];
arr[j - 1] = arr[j];
arr[j] = tmp;
}
}
}
}
void printArr(int arr[], int n)
{
int i;
for (i = 0;i < n;i++)
{
cout << " " << arr[i];
}
cout << endl;
}
int main()
{
int arr[10] = { 9, 7, 10, 12, -1, 3, -8, 0, 18, 36 };
printArr(arr, 10);
selectsort(arr, 10);
printArr(arr, 10);
return 0;
}
C++之冒泡排序法(数组)
猜你喜欢
转载自blog.csdn.net/qq_38642470/article/details/82380612
今日推荐
周排行