<span style="font-size:14px;">冒泡排序分两层,第一层遍历待排序序列,第二层依次比较相邻两个元素的大小,然后将其移动,若有一趟未发生移动,则代表序列已经是排</span><span style="font-size:14px;">序好了。所有其时间复杂度最好情况O(n),平均为O(n^2)。</span>
#include <iostream>
#include <stdio.h>
using namespace std;
int printarry(int* arry,int len){
for(int i=0 ; i<len ; i++ ){
printf("%d ",arry[i]);
}
printf("\n");
return 1;
}
int bubblesort(int *unsorted , int len){
for(int i = len-1 ; i > 0 ;i--){
bool isSwap = false;
for (int j = 0 ; j < i ; j++){
if(unsorted[j] > unsorted[j+1]){
int t = unsorted[j];
unsorted[j] = unsorted[j+1];
unsorted[j+1] = t;
isSwap = true;
}
}
if (isSwap == false)
return 1;
}
return 1;
}
int main()
{
cout << "Hello world!" << endl;
int sortarry[] = {5,2,72,1,777,22222,22};
// int sortarry[] = {1,2,3,4,7,21,22};
int len = sizeof(sortarry)/sizeof(int);
printf("unsorted arry len is %d ,value is: ",len);
printarry(sortarry,len);
bubblesort(sortarry,len);
printf("sorted arry len is %d ,value is: " ,len);
printarry(sortarry,len);
return 0;
}