冒泡排序

#include <stdio.h>

typedef int ElementType;

void SwapTwoNum(ElementType *Num_1,ElementType *Num_2)
{
    int NumTemp = *Num_1;
    *Num_1 = *Num_2;
    *Num_2 = NumTemp;
}

void BubbleSort(ElementType *Array,int ArrayLen)
{
    int i,j;
    for(i = 0;i < ArrayLen-1;i ++)
    {
        for(j = 0;j < ArrayLen-i-1;j ++)
        {
            if(Array[j]>Array[j+1])
            {
                SwapTwoNum(&Array[j],&Array[j+1]);
            }
        }
    }
}

int main()
{
    ElementType TestArray[10] = {8,9,2,4,1,2,5,9,3,7};
    BubbleSort(TestArray,10);
    int i;
    for(i = 0;i < 10;i ++)
    {
        printf("%d ",TestArray[i]);
    }
    printf("
");
    return 0;
}
原文地址:https://www.cnblogs.com/Asurudo/p/9427397.html