算法之冒泡排序

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

#define MAXLENGTH 21

typedef struct
{
    int key;
} Record;

typedef struct
{
    Record r[MAXLENGTH];
    int length;
} DataList;

void printList(DataList *list)
{
    int i = 0;
    for(i-0; i<list->length; i++)
    {
        printf("%d  ",list->r[i]);
    }
    printf("\n");
}

void bubble_sort(DataList *list)
{
    int i=0;
    int j = 0;

    for (i=1; i<list->length; i++)
    {
        for(j=1; j<list->length-i; j++)
        {
            if(list->r[j].key>list->r[j+1].key)
            {
                list->r[0] = list->r[j+1];
                list->r[j+1] = list->r[j];
                list->r[j] = list->r[0];
            }
        }
    }
}

int main()
{
    DataList *list = (DataList *)malloc(1*sizeof(DataList));
    memset(list,0,sizeof(DataList));

    srand(time(0));

    int m = 0;
    int index = 1;
    for(m=0; m<20; m++)
    {
        int i = 0;
        i = rand() % 100;
        list->r[index].key = i;
        list->length++;
        index++;
    }

    printList(list);

    bubble_sort(list);

    printList(list);
}

c语言实现冒泡排序