AOJ-ALDS1_2_A Bubble Sort【冒泡排序】

Bubble Sort

 Aizu - ALDS1_2_A 
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

问题链接：AOJ-ALDS1_2_A Bubble Sort

问题简述：（略）
问题分析：
  冒泡排序问题，求使用冒泡排序算法时数据交换的次数。
  没有想出来不排序怎么计算，就直接用排序算法实现了，中间统计一下交换的次数。

程序说明：
  程序是冒泡排序的原始算法，稍微作了一些改动。
  冒泡排序算法封装到函数insertion_sort()中。
  需要注意的是，同时要输出排序结果。

题记：（略）

参考链接：（略）

AC的C++语言程序如下：/* AOJ-ALDS1_2_A Bubble Sort */

#include <iostream>

using namespace std;

/* 冒泡排序 */
int bubble_sort(int a[], int n)
{
int cnt = 0;

for(int i=0; i<n-1; i++)
for(int j=n-1; j>=i+1; j--)
if(a[j] < a[j - 1])
cnt++, swap(a[j], a[j - 1]);

return cnt;
}

void output_result(int a[], int n)
{
for(int i=0; i<n; i++) {
if(i > 0)
cout << " ";
cout << a[i];
}
cout << endl;
}

const int N = 100;
int a
;

int main()
{
int n;
cin >> n;
for(int i=0; i<n; i++)
cin >> a[i];

int cnt = bubble_sort(a, n);

output_result(a, n);
cout << cnt << endl;

return 0;
}