C++冒泡排序代码实现
冒泡排序实现,就当学习吧,两个for循环加判断
#include <iostream>
using namespace std;
void sort(int arr[],int lenth)
{
for (int i=0; i < lenth; i++)
{
for (int j=0; j < lenth - 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 a[8] = { 3,8,9,2,10,20,7 };
int len = sizeof(a) / sizeof(a[0]) - 1;
cout << "排序前";
for (int i = 0; i < len; i++)
{
cout <<" "<< a[i];
}cout << endl;
sort(a, len);
cout << "排序后";
for (int i = 0; i < len; i++)
{
cout <<" "<< a[i];
}
system("pause");
}