冒泡排序

来源:互联网 发布:婚庆门户源码 编辑:程序博客网 时间:2024/06/06 02:26
#include <stdio.h>void bubble_sort(int a[], int n){for(int i = 0; i < n - 1; i++){for(int j = 0; j < n - i -1; j++){if(a[j+1] < a[j]){int temp = a[j+1];a[j+1] = a[j];a[j] = temp;}}}for(int i = 0; i < n; i++){printf("%d ", a[i]);}printf("\n");}int main(){int a[5] = {5,4,3,2,1};bubble_sort(a, 5);return 0;}

0 0
原创粉丝点击