---

数据结构----冒泡排序

---

---

原理：参考趣学数据结构

---

---

代码：

---

#include<stdio.h>
#include<stdlib.h>
void bubbleSort(int a[], int length) {//冒泡排序for (int i = 0; i < length - 1; i++) {//趟数for (int j = 0; j < length - i - 1; j++) {if (a[j] > a[j + 1]) {int temp = a[j];a[j] = a[j + 1];a[j + 1] = temp;}}}
}
void print5(int a[],int length) {for (int i = 0; i < length; i++) {printf("%d ", a[i]);}printf("\n");
}
int main() {int a[] = { 4,5,3,7,2,1,4,8,96,43,2,34 };int length = sizeof(a) / sizeof(a[0]);printf("排序前:\n");print5(a,length);bubbleSort(a,length);printf("排序后:\n");print5(a,length);system("pause");return 0;
}

---

测试截图：

---

---

时间复杂度O(n*2),空间复杂度O(1)

---

---

如果存在什么问题，欢迎批评指正！谢谢！

---