C语言冒泡优化排序（函数）

#include<stdio.h>

void my_mpsort(int *p,int n){
	int i,j,flag,temp = 0;
	for(i = 0;i < n-1;i++){
		flag = 0;
		for(j = 0;j < n-1-i;j++){
			if(p[j] > p[j+1]){
				temp = p[j];
				p[j] = p[j+1];
				p[j+1] = temp;
				flag = 1;
			}
		}
		if(flag == 0){
			break;
		}
	}
}

void my_input(int *p,int n){
	for (int i = 0;i < 10;i++){
		scanf("%d",&p[i]);
	}
}

void my_print(int *p,int n){
	for(int i = 0;i < n;i++){
		printf("%d\t",p[i]);
	}	
	putchar(10);
}

int main(int argc, const char *argv[])
{
	int a[10] = {0};
	my_input(a,sizeof(a)/sizeof(a[0]));
	my_print(a,sizeof(a)/sizeof(a[0]));
	my_mpsort(a,sizeof(a)/sizeof(a[0]));
	my_print(a,sizeof(a)/sizeof(a[0]));
	return 0;
}