罗马废墟函数FUN的功能是; 把形参a所指数组中的最大值放杂a[0]中,接着求出a所指数组中的最小值防在 a[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