蓝桥杯真题三部排序

代码填空 2013 省 赛

难度：简单

#include <stdio.h>

void show(int* x, int len)
{
    int i;
    for(i=0; i<len; i++)
    {
        printf("%d,",x[i]);
    }
    
    printf("\n");
}

void sort3p(int* x, int len)
{
    int p = 0;
    int left = 0;
    int right = len-1;
    
    while(p<=right){
        if(x[p]<0){
            int t = x[left];
            x[left] = x[p];
            x[p] = t;
            left++;
            p++;
        }
        else if(x[p]>0){
            int t = x[right];
            x[right] = x[p];
            x[p] = t;
            right--;
            //p++;                
        }
        else{
            _______________;
        }
    }
    
    show(x, len);
}

int main()
{
    int a[] = {-1,0,1,-2,0,2,-3,0,0,3,-4,-5,4,-6,0,5,6};
    int b[] = {-1,0,-1,-2,0,-2,-3,0,0,-3,-4,-5,-4,-6,0,-5,-6};
    int c[] = {1,0,1,2,0,2,3,0,0,3,4,5,4,6,0,5,6};
    
    sort3p(a,sizeof(a)/sizeof(int));
    sort3p(b,sizeof(b)/sizeof(int));
    sort3p(c,sizeof(c)/sizeof(int));
        
    return 0;
}

 

#include <stdio.h>

void show(int* x, int len)
{
    int i;
    for(i=0; i<len; i++)
    {
        printf("%d,",x[i]);
    }
    
    printf("\n");
}

void sort3p(int* x, int len)
{
    int p = 0;
    int left = 0;
    int right = len-1;
    
    while(p<=right){
        if(x[p]<0){
            int t = x[left];
            x[left] = x[p];
            x[p] = t;
            left++;
            p++;
        }
        else if(x[p]>0){
            int t = x[right];
            x[right] = x[p];
            x[p] = t;
            right--;
            //p++;                
        }
        else{
            p++;
        }
    }
    
    show(x, len);
}

int main()
{
    int a[] = {-1,0,1,-2,0,2,-3,0,0,3,-4,-5,4,-6,0,5,6};
    int b[] = {-1,0,-1,-2,0,-2,-3,0,0,-3,-4,-5,-4,-6,0,-5,-6};
    int c[] = {1,0,1,2,0,2,3,0,0,3,4,5,4,6,0,5,6};
    
    sort3p(a,sizeof(a)/sizeof(int));
    sort3p(b,sizeof(b)/sizeof(int));
    sort3p(c,sizeof(c)/sizeof(int));
        
    return 0;
}

思路

        此题不难看出 在sort3p函数内

        通过if判断是否正数，负数挪到前面，正数挪到后面

        所以当0 的时候，不需要进行任何操作，只需要p++，将需要排序的位数移至下一位，当遇到负数时，前面的0自然会被交换