关于奇偶交换排序的一道题，求高手解答

#include <stdio.h>

#define MAX_SIZE 20
#define COUT printf("%d\n", counter++)

typedef enum { false, true }bool;
unsigned int counter = 0;
/*

 *获取控制台的输入

 */
bool get_inputs(int array[], unsigned int *size)
{
    printf("输入数组:");

    while (scanf("%d", &array[(*size)]))
    {
        ++(*size);
    }

    if ((*size)>MAX_SIZE)
    {
        return false;
    }

    return true;
}

/*

 *奇数下标元素开始的进行调整

 */
bool odd_sort(int array[], unsigned int size)
{
    unsigned int i;
    bool odd_flag = true;//奇数标志

    for (i=1; i+1<size; i=i+2)
    {
        if (COUT, array[i] > array[i+1])
        {
            array[i] = array[i+1] + array[i];
            array[i+1] = array[i] - array[i+1];
            array[i] = array[i] - array[i+1];
            odd_flag = false;
        }
    }

    return odd_flag;
}
/*

 *偶数下标元素开始的进行调整

 */
bool even_sort(int array[], unsigned int size)
{
    unsigned int i;
    bool even_flag = true;//偶数标志

    for (i=0; i+1<size; i=i+2)
    {
        if (COUT, array[i] > array[i+1])
        {
            array[i] = array[i+1] + array[i];
            array[i+1] = array[i] - array[i+1];
            array[i] = array[i] - array[i+1];
            even_flag = false;
        }
    }

    return even_flag;
}
/*

 *输出整个的数组

 */
void display(int array[], unsigned int size)
{
    unsigned int i;

    for (i=0; i<size; ++i)
    {
        printf("%d ", array[i]);
    }
    printf("\n\n");
}

void function()
{
    int array[MAX_SIZE] = {0};
    unsigned int size = 0;//表示数组的长度

    if (!get_inputs(array, &size))
    {
        return;
    }

    while (!odd_sort(array, size) || !even_sort(array, size));

    display(array, size);
}

int main(void)
{
    function();

    return 0;
}