• 欢迎访问废江网站，承蒙遇见` QQ群`
• 本站将致力于推送优质的java知识以及算法，开源代码！

# Selection Sort

4年前 (2020-03-28) 21025次浏览

## Question

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

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 6 of the pseudocode in the case where i ≠ mini.

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 space 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
6
5 6 4 2 1 3
Sample Output 1
1 2 3 4 5 6
4

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

## Summary

[]
(1)个小伙伴在吐槽
1. ok,thank you!
站点默认2021-06-24 15:42 回复
• 版权声明

本站的文章和资源来自互联网或者站长
的原创，按照 CC BY -NC -SA 3.0 CN
协议发布和共享，转载或引用本站文章
应遵循相同协议。如果有侵犯版权的资
源请尽快联系站长，我们会在24h内删
除有争议的资源。
• 网站驱动

• 友情链接

• 联系我