【排序】BubbleSort

最新推荐文章于 2021-03-15 16:53:46 发布

转载最新推荐文章于 2021-03-15 16:53:46 发布 · 68 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/no7dw/archive/2012/11/17/2774256.html

本文解释了冒泡排序名称的由来及其工作原理。通过从数组底部开始比较并逐步将较大的元素向上移动，每次循环都能找到当前未排序部分的最小元素。文章还提供了实现冒泡排序的 C 语言代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Why it call Bubble Sort? It's name contains what kind of method it uses:

Every time by comparing i_item from bottom to top ,if found greater one, i_item raises one step .

In one loop, one smallest one is found.

Here are the codes:

// BubbleSort.c
#include <stdio.h>
#include " type.h "
void swap(ElemType  **a, ElemType **b)
{

    ElemType tmp = *a;
    *a=*b;
    *b=tmp;

}
void BubbleSort( SqList *L)
{
     int i;
     for(i= 0;i<L->length ; i++)
    {
         int j;
         for(j=i+ 1; j<L->length; j++)
        {
             if(L->data[i]> L->data[j])
            {
                swap(&L->data[i], &L->data[j]);
            }
        }
    }
}
void printContent(SqList *L)
{
     int i;
     for(i= 0;i< L->length;i++)
    {
        printf( " %d ", L->data[i]);
    }
}
void main( void)
{
    SqList list, *slist;
    slist = &list;
    slist->data[ 0]= 1;
    slist->data[ 1]= 5;
    slist->data[ 2]= 4;
    slist->data[ 3]= 2;
    slist->data[ 4]= 22;
    slist->length= 5;
    printContent(slist);
    printf( " \n ");
    BubbleSort(slist);
    printContent(slist);
    printf( " \n ");
}

There will be one blog later about swap function to explain the pointer problem

// type.h
#define MAXSIZE 20
typedef int ElemType;
typedef struct {
ElemType data[MAXSIZE];
int length;
}SqList;

转载于:https://www.cnblogs.com/no7dw/archive/2012/11/17/2774256.html