ALDS1_2_A: Bubble Sort(几何)

最新推荐文章于 2021-02-07 21:59:40 发布

creator平

最新推荐文章于 2021-02-07 21:59:40 发布

阅读量240

点赞数

CC 4.0 BY-SA版权

分类专栏：数学几何

本文链接：https://blog.youkuaiyun.com/weixin_41380961/article/details/99538403

数学几何专栏收录该内容

11 篇文章

订阅专栏

本文详细介绍了冒泡排序算法的实现过程，通过伪代码展示了算法的基本逻辑，并提供了一个具体的C++代码示例。文章解释了如何对序列进行升序排序，并统计交换操作的次数。此外，还给出了输入输出的格式说明以及样例，帮助读者理解和实践冒泡排序算法。

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

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

题目连接：http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_2_A

#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<complex>
using namespace std;
typedef complex<double> qua;
void solve(qua a,qua b,qua c)
{
    b-=a,c-=a;
    qua ans=c*conj(b);
    if(ans.imag()>0) printf("COUNTER_CLOCKWISE\n");
    else if(ans.imag()<0) printf("CLOCKWISE\n");
    else if(ans.real()<0) printf("ONLINE_BACK\n");
    else if(abs(c)>abs(b)) printf("ONLINE_FRONT\n");
    else printf("ON_SEGMENT\n");
}
int main()
{
    double x1,y1,x2,y2,x3,y3;
    int m;
    scanf("%lf%lf%lf%lf%d",&x1,&y1,&x2,&y2,&m);
    while(m--)
    {
        scanf("%lf%lf",&x3,&y3);
        solve(qua(x1,y1),qua(x2,y2),qua(x3,y3));
    }
}