排序：冒泡 选择

冒泡

#include <stdio.h>
#include <stdlib.h>

#define N 10

int main(void)
{
    int i,j,tmp;
    int a[N] = { 2,1,45,65,34,35,36,22,12,25};
    for(i = 0;i<(N-1);i++)
    {
        for(j = 0;j<N -i -1;j++)
        {
            if(a[j]>a[j+1])
            {
                tmp = a[j];
                a[j] = a[j+1];
                a[j+1] = tmp;
            }
        }

    }
    for(j = 0;j<N;j++)
    {
        printf("%d ",a[j]);
    }
    printf("\n");
    exit(0);
}

选择

#include <stdio.h>

#define N 10

int main()
{
    int i,j,k,tmp;
     //int a[N] = { 2,1,45,65,34,35,36,22,12,25};
    int a[N] ={23,35,90,76,13,55,76,45,3,8};

    for(i = 0; i<sizeof(a)/sizeof(a[i]);i++)
        printf("%d ",a[i]);
    printf("\n");

    for( i =0;i<(N-1) ;i++)
    {
        k = i;
        for(j = i+1;j< N;j++)
        {
            if(a[k] > a[j])
                    k = j;
        }
            if(i!=k)
            {
                tmp = a[i];
                a[i] = a[k];
                a[k] = tmp;
            }
    }
    for(i = 0; i<sizeof(a)/sizeof(a[i]);i++)
        printf("%d ",a[i]);
    printf("\n");
    return 0;
}