冒泡排序（c语言实现）

#include<stdio.h>
#include<stdlib.h>

void maopao(int *arr,int count)
{
int length,i,j;
int temp;
//length = sizeof(arr);
length = count;
for(i = 0;i<length -1;i++){
for(j = 0;j<length-i-1;j++)
{
if(arr[j]>arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}

printf("排序以后\n");
for(i=0;i<length;i++)
{
printf("%d ",arr[i]);
}
}

void main()
{
int *arr;
int n,i,q;
printf("Please input thr size of the array:");
scanf("%d",&n);
arr = (int*)malloc(sizeof(int)*n);
for(i = 0;i<n;i++)
{
scanf("%d",&q);
arr[i] = q;
}
printf("排序以前\n");
for(i=0;i<n;i++)
{
printf("%d ",arr[i]);
}

maopao(arr,n);
}