【冒泡排序】c++实现冒泡排序代码

#include
using namespace std;

void print(int arr[], int n)
{
for(int j= 0; j<n; j++)
{
cout<<arr[j] <<" ";
}
cout<<endl;
}

void BubbleSort(int arr[], int n)
{
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}

int main()
{
int s[10] = {8,1,9,7,2,4,5,6,10,3};
cout<<“初始序列：”;
print(s,10);
BubbleSort(s,10);
cout<<“排序结果：”;
print(s,10);
system(“pause”);
}

原文链接：https://blog.csdn.net/yangchuang93/article/details/80858054