冒泡排序

//冒泡排序的C实现#include <stdio.h>void swap(int *a,int *b){int temp = *a;*a = *b;*b = temp;}void pop_sort(int a[] , int p, int r){int i,j;for(i = r; i > p ; i--)//每一遍，将最大的数字放在i的位置上{for(j = p ; j < i; j++){if(a[j] > a[j+1]){swap(&a[j],&a[j+1]);}}}}int main(){int i; int a[23] = {23,35,456,7,456,576,456,45,56,67,56,45,45,576,45,7,45,567,45,45,45,56,45};pop_sort(a,0,22);for(i=0; i<23; i++){printf("%d ",a[i]);}return 0;}