ALDS1_2_A: Bubble Sort

题目

Bubble Sort
Write a program of the Bubble Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

BubbleSort(A)
1 for i = 0 to A.length-1
2     for j = A.length-1 downto i+1
3         if A[j] < A[j-1]
4             swap A[j] and A[j-1]
Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 4 of the pseudocode.

Input
The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by spaces characters.

Output
The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints
1 ≤ N ≤ 100

Sample Input 1
5
5 3 2 4 1
Sample Output 1
1 2 3 4 5
8

Sample Input 2
6
5 2 4 6 1 3
Sample Output 2
1 2 3 4 5 6
9

代码块（不用flag）

#include <stdio.h>

void Trace(int n, int *a)
{
    for(int i=0; i<n; i++)
    {
        if(i!=n-1)
            printf("%d ", a[i]);
        else
            printf("%d\n", a[i]);
    }
}

void BubbleSort(int n, int *a)
{
    int i, j, v;
    int count = 0;
    for(i=0; i<n-1; i++)
    {
        for(j=0; j<n-i-1; j++)
        {
            if(a[j]>a[j+1])
            {//注意这里如果将>改为>=，则算法会失去稳定性（即相同元素排序后的顺序不是排序前的顺序）
                v = a[j];
                a[j] = a[j+1];
                a[j+1] = v;
                count++;
            }
        }
    }
    Trace(n, a);
    printf("%d\n", count);
}

int main(void)
{
    int i, n;
    scanf("%d", &n);
    int a[n];
    for(i=0; i<n; i++)
        scanf("%d", &a[i]);
    BubbleSort(n, a);
    return 0;
}

代码块（用flag）

#include <stdio.h>

void Trace(int n, int *a)
{
    for(int i=0; i<n; i++)
    {
        if(i!=n-1)
            printf("%d ", a[i]);
        else
            printf("%d\n", a[i]);
    }
}

void BubbleSort(int n, int *a)
{
    int i, j, v;
    int count = 0;
    int flag = 1;//这里使用flag来判断数组排序是否提前完成
    for(i=0; flag; i++)
    {
    	flag = 0;//进入循环后flag重置为0
        for(j=0; j<n-i-1; j++)
        {
            if(a[j]>a[j+1])
            {//只有在一次冒泡中有元素交换才将flag置为1，否则就表示数组已经有序，flag为0退出循环
                v = a[j];
                a[j] = a[j+1];
                a[j+1] = v;
                count++;
                flag = 1;
            }
        }
    }
    Trace(n, a);
    printf("%d\n", count);
}

int main(void)
{
    int i, n;
    scanf("%d", &n);
    int a[n];
    for(i=0; i<n; i++)
        scanf("%d", &a[i]);
    BubbleSort(n, a);
    return 0;
}