Re-discharge an integer sequence in the order of odd numbers, and the even number is required to be ordered.

Re-discharge an integer sequence in the order of odd numbers, and the even number is required to be ordered. Write a function implementation. #include #define n 15

Void sort (int *, int); void swap (int *, int *);

Int main () {int tent_Array [n] = {0, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 11, 15, 13, 0}; INT I;

Sort (int_array, n); for (i = 0; i

Return 0;}

/ * define the function sort () * // * parameter: int *, int * // * Return: void * // * function: rank a integer array * / void sort (int * ptr, int N) {INT i , J; / * loop variable * / / / * rank odd number * / for (i = 0; i i; j -) IF (PTR [J] ! = 0 && PTR [J]% 2 == 1) IF ((PTR [J]% 2 PTR [J-1]% 2! = 2) || (PTR [J] 0; I -) for (j = 0; J PTR [J 1])) SWAP (& PTR [J], & PTR [J 1]); / * Rank Result: Odd Number Before Zero, Even Number After Zero, * / / * There Are Form Small To Big ! * /}

/ * Define the function swap () * // * parameter: int *, int * * // * Return: void * // * function: swap two number * / void swap (int * fst, int * sec) {int * Temp; temp = * fst; * fst = * sec; * sec = TEMP;