#include<iostream>
using namespace std;
int main()
{
int arr[5] = { 5,3,2,1,4 };
cout << "排序前的数组:";
for (int i = 0; i < 5; i++)
{
cout << arr[i] << " ";
}
cout << endl;
for (int i = 0; i < 5-1; i++)
{
for (int j = 0; j < 5-i-1; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
cout << "排序后的数组:";
for (int i = 0; i < 5; i++)
{
cout << arr[i] << " ";
}
}
2.
#include<iostream>
using namespace std;
void bubblesort(int *arr,int len)
{
for (int i = 0; i < len - 1; i++)
{
for (int j = 0; j < len - 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 arr[] = { 4,3,5,2,1 };
cout << "排序前的数组:";
for (int i = 0; i < 5; i++)
{
cout << arr[i] << " ";
}
cout << endl;
int len = sizeof(arr) / sizeof(arr[0]);
bubblesort(arr, len);
cout << "排序后的数组:";
for (int i = 0; i < 5; i++)
{
cout << arr[i]<<" ";
}
}