算法导论-冒泡排序-C语言版

#include <stdio.h>#include <stdlib.h>#define MAX_INT 655354#define NUM 16void bubbleSort(int array[], int length);int main(){    int array[NUM] = {23,12,3,4,2,3,234,5655,34,123,445,44,3,4,56,78};    int i ;    //mergeSort(array,0,NUM - 1);    bubbleSort(array,NUM);    for(i = 0; i < NUM; ++i )    {        printf("%d ",array[i]);    }    return 0;}void bubbleSort(int array[], int length){    int i,j;    for(i = 1; i < length; ++i)    {        for(j = 0; j < length - i; ++j)        {            if(array[j] > array[j + 1])            {                int temp = array[j];                array[j] = array[j + 1];                array[j + 1] = temp;            }        }    }}