Sorting - bubble sort

关注

原创最新推荐文章于 2026-10-14 13:04:38 发布 604 阅读 AI 写同款· GEO 优化 ›

基于AFC数据与LightGBM的地铁站短时出站客流预测实践地铁自动售检票系统（AFC）每笔刷卡都隐含着时空维度的交通行为信息，而短时客流预测正是挖掘其价值的关键技术方向。通过对AFC历史交易数据进行清洗与重采样，结合时间属性、滞后特征、天气与节假日等外部变量，形成反映客流周期性与突变性的结构化特征集。在模型选型上，树模型因对混合特征处理天然友好、训练高效且具备可解释性，成为构建稳健基线的理想选择，能够有效捕捉早高峰与晚高峰的动态波动。该技术广泛应用于站点运力调度、站台拥挤度预警和应急疏散决策等场景，显著提升城市轨道交通运营的精细化管理水平。本文以真实站点刷卡数据为阅读详情

#include "stdio.h"
#include "string.h"

#define MAX_LIST 50


typedef struct _SqList {
    int data[MAX_LIST];
    int length;
}SqList;

void swap( SqList* L,  unsigned index1, unsigned index2 )
{
    if( index1 >= L->length || index2 >= L->length ) return;

    if( index1 == index2 ) return;

    L->data[index1] = L->data[index1] ^ L->data[index2];

    L->data[index2] = L->data[index1] ^ L->data[index2];

    L->data[index1] = L->data[index1] ^ L->data[index2];
}

enum BUBBLE_SORT_METHOD { PLAIN, FLAG };

//original bubble sort algorithm
void BubbleSortPlain(SqList* L)
{

    int i, j;

    for( i = 0; i < L->length - 1; i++ )
    {
        //every outer loop pick the smallest from the rear of the array
        for( j = L->length-2; j >= i; j-- )
        {  
            //compare adjacent elements and get the smaller move forward
            if( L->data[j] > L->data[j+1] )
                swap(L, j, j+1 ); 
        }
    }
}


//Optimized with a flag indicating should there any swapping occurred in the previous loop
//if there is no swapping, loop should exit prematurely
void BubbleSortFlag(SqList* L)
{
    bool flag = true;
    int i, j;
    for( i = 0; flag && i < L->length - 1; i++ )
    {
        //every outer loop pick the smallest from the rear of the array
        for( j = L->length-2; j >= i; j-- )
        {  
            flag = false;
            //compare adjacent elements and get the smaller move forward
            if( L->data[j] > L->data[j+1] )
            {
                swap(L, j, j+1 ); 
                flag = true;
            }
        }
    }
}

void BubbleSort( SqList* L, BUBBLE_SORT_METHOD bs )
{
    if( bs == PLAIN )
    {
        BubbleSortPlain( L );
    }
    else
    {
        BubbleSortFlag( L );
    }
}


int main()
{
    SqList d;
    int intarr[] = {1,10,23,48,65,31,-21,9,88,100};
    memcpy( d.data, intarr, sizeof(intarr));
    d.length = sizeof(intarr)/sizeof(int);  
    int index = 0;
    printf("Original array:\n");
    for( ; index < d.length; index++ )
        printf(" %d", d.data[index] );
    printf("\nBubble sort...\n");
    BubbleSort( &d, FLAG );
    for( index = 0; index < d.length; index++ )
        printf(" %d", d.data[index] );
    printf("\n");
    return 0;
}