数组排序问题

有一个整型数组int A[nSize]，其中隐藏着若干0，其余非0整数，写一个函数int Func(int* A, int nSize)，

使A把0移至后面，非0整数移至数组前面并保持有序(保持原来的顺序)，返回值为原数据中第一个元素为0的下标。

#include <stdio.h>int Func(int *a, int nSize){int i,k,t=1,flag = 0;for (i=0; i<nSize-1;i++){if (a[i] == 0 && flag == 0){k = i;}if (a[i] == 0 && a[i+1] != 0){a[i+1-t] = a[i+1];  //隔了多少个0a[i+1] = 0;}else if (a[i] == 0 && a[i+1] == 0){t++;}}return k;}int main(){int i;int a[] = {1,2,3,0,4,5,0,6,0,0,0,0,0,0,0,1,5,4,1,22,-65,1545,0,0,0,54,12,35};for (i=0; i<sizeof(a)/sizeof(a[0]);i++){printf("%d ",a[i]);}printf("\n");Func(a,sizeof(a)/sizeof(a[0]));for (i=0; i<sizeof(a)/sizeof(a[0]);i++){printf("%d ",a[i]);}printf("\n");return 0;}