罗马废墟函数FUN的功能是:把形参a所指数组总的奇数原顺序依次存放到a[0],a[1],a[2].……中,把偶数从数组中
1个回答

#include

#define N 9

//

for (j=___3___; j a[j])

{ min = a[j]; pn = j; }

}

if (px != i)

{ t = a[i]; a[i] = max; a[px] = t;

if (pn == i) pn= px;

}

if (pn != i+1)

{ t = a[i+1]; a[i+1] = min; a[pn] = t; }

}

}

main( )

{ int b[N]={1,4,2,3,9,6,5,8,7},i;

printf("nThe original data :n");

for (i=0; i

相关问题