交叉排序

#include "stdafx.h"

#include <stdio.h>
#include<iostream>

using namespace std;

#define length 100

int arry[length] = { 0 };
int num;
char ch;
int cnt = 0;

int main(void)
{
    while (1)
    {
        scanf_s("%d", &num);
        ch = getchar();
        arry[cnt++] = num;
        if (ch == '
')
        {
            break;
        }
    }
    for (int i = 0; i < ((cnt-1) / 2) * 2 ; i++, i++)
    {
        for (int j = ((cnt - 1) / 2) * 2 - 2; j >= i; j--, j--)
        {
            if (arry[j]>arry[j + 2])
            {
                int tmp;
                tmp = arry[j];
                arry[j] = arry[j + 2];
                arry[j + 2] = tmp;
            }
        }
    }
    for (int i = 1; i < (cnt - 1) + ((cnt - 1) % 2) - 1; i++, i++)
    {
        for (int j = (cnt - 1) + ((cnt - 1) % 2) - 3; j >= i; j--, j--)
        {
            if (arry[j]<arry[j + 2])
            {
                int tmp;
                tmp = arry[j];
                arry[j] = arry[j + 2];
                arry[j + 2] = tmp;
            }
        }
    }

    for (int i = 0; i < cnt; i++)
    {
        cout << arry[i]<<' ';
    }
    cout << endl;
    return 0;
}

#include "stdafx.h"

#include <stdio.h>
#include<iostream>

using namespace std;

#define length 100

int arry[length] = { 0 };
int num;
char ch;
int cnt = 0;

int main(void)
{
    while(scanf("%d",&num)!=EOF)
    {
        cnt=0;
        arry[cnt++] = num;
        while (1)
        {
            scanf("%d", &num);
            ch = getchar();
            arry[cnt++] = num;
            if (ch == '
')
            {
                break;
            }
        }
        for (int i = 0; i < ((cnt-1) / 2) * 2 ; i++, i++)
        {
            for (int j = ((cnt - 1) / 2) * 2 - 2; j >= i; j--, j--)
            {
                if (arry[j]>arry[j + 2])
                {
                    int tmp;
                    tmp = arry[j];
                    arry[j] = arry[j + 2];
                    arry[j + 2] = tmp;
                }
            }
        }
        for (int m = 1; m < (cnt - 1) + ((cnt - 1) % 2) - 1; m++, m++)
        {
            for (int n = (cnt - 1) + ((cnt - 1) % 2) - 3; n >= m; n--, n--)
            {
                if (arry[n]<arry[n + 2])
                {
                    int tmp;
                    tmp = arry[n];
                    arry[n] = arry[n + 2];
                    arry[n + 2] = tmp;
                }
            }
        }

        for (int k = 0; k < cnt; k++)
        {
            cout << arry[k]<<' ';
        }
        cout << endl;
    }

    return 0;
}