冒泡排序法

来源：互联网发布：伤感网络歌曲女生唱的编辑：程序博客网时间：2024/06/06 09:26

1、

void bubble_sort(int *pi_array, const int i_size){    int i_last_swap = 0;    int i_last_swap_tmp = 0;    for (int i = 0; i < i_size; ++i)    {        i_last_swap = i_last_swap_tmp;        for (int j = i_size - 1; j > i_last_swap; --j)        {            if (pi_array[j] < pi_array[j - 1])            {                int i_tmp = pi_array[j];                pi_array[j] = pi_array[j - 1];                pi_array[j - 1] = i_tmp;                i_last_swap_tmp = j;            }        }        if (i_last_swap_tmp == i_last_swap)        {            break;        }    }    return;}

2、

void BubbleSort3(int a[], int n){       int j, k;       int flag;             flag = n;       while (flag > 0)       {              k = flag;              flag = 0;              for (j = 1; j < k; j++)                     if (a[j - 1] > a[j])                     {                            Swap(a[j - 1], a[j]);                            flag = j;                     }       }}

0 0