#include<stdio.h>
#define SIZE 200

main()
{
    int a[SIZE];
    int count=1;
    int pass, hold, num, i;
    printf("Please input the number of integers:");
    scanf("%d", &num);
    printf("Please input the integers:");
   
    for(i=0; i<=num-1; i++){
        scanf("%d", &a[i]);
    }
   
    for(pass=0; pass<=num-1; pass++){
        for(i=0; i<=num-2; i++){
            if(a[i]%2!=0&&a[i+1]%2==0){
                hold=a[i];
                a[i]=a[i+1];
                a[i+1]=hold;
            }
        }
    }
    printf("The elements of the new array are:");
   
    for(i=0; i<=num-1; i++)
       printf("%2d",a[i]);
      
    return 0;
}

题目：排序，偶在前，奇在后

没什么需要改的了吧？不太懂lz的意思了。

额。。。明白了 。感觉有点问题。

printf("Please input the number of integers:");
麻烦把提示语句在说的明白一点
我运行一下就输了个数
谁知是下面要数这么多个

for(pass=0; pass<=num-1; pass++){
        for(i=0; i<=num-2; i++){
            if(a[i]%2!=0&&a[i+1]%2==0){
                hold=a[i];
                a[i]=a[i+1];
                a[i+1]=hold;
            }
        }
    }
我感觉这个地方有点麻烦。。。如果是我  我不会这样写。。。请大神指导。

#include
#define SIZE 200

main()
{
    int a[SIZE];
    int count=1; //这个地方是干嘛用的？没理解。
    int begin, end, num,tmp, i;
    printf("Please input the number of integers:");
    scanf("%d", &num);
    printf("Please input the integers:");
   
    for(i=0; i<=num-1; i++){
        scanf("%d", &a[i]);
    }
    for（begin=0,end=num-1;begin>=end;begin++.end--）
    {
        while(a[begin]%2==0)
               begin++;
        while(a[end]%2==1)
            end--;
         tmp=a[begin];
         a[begin]=a[end];
         a[end]=tmp;

    }
       printf("The elements of the new array are:");
   
    for(i=0; i<=num-1; i++)
       printf("%2d",a[i]);
      
    return 0;
}
请大神指导。。。

int count=1;他都没有用！

# include 

int main ()
{
   int a[10];
   int i, j, t;

   for (i = 0; i < 10; i++)
       scanf("%d", &a[i]);

   for (i = 0; i < 9; i++)
       if (a[i] % 2 != 0)
           for (j = i+1; j < 10; j++)
               if (a[j] % 2 == 0) {
                   t = a[i];
                   a[i] = a[j];
                   a[j] = t;
                   break;
               }
    for (i = 0; i < 10; i++)
        printf("%d ", a[i]);
    printf("\n");
    return 0;

}

[ 本帖最后由 pangshch 于 2013-12-6 16:18 编辑 ]

void sort()
{
    int tmp, i = 0, j = NUM_COUNT - 1;
    while (i < j)
    {
        while (0 == s[i] % 2 && i < j)
        {
            i++;
        }
        while (1 == s[j] % 2 && i < j)
        {
            j--;
        }
        if (i >= j) break;
        tmp = s[i], s[i] = s[j], s[j] = tmp;
        i++, j--;
    }
}

正解，嘿嘿，学习了