How to implement selection sorting in C++

This article introduces the relevant knowledge of "how to achieve selection sorting in C++". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

Selective sorting, as one of the eight classical algorithms, is not as efficient as insert, fast, Hill and other sorting, but its structure is simple, the train of thought is clear, it is suitable for beginners to understand the algorithm, to understand sorting, and is suitable for sorting when there is less data.

The following is the graphical principle of selective sorting

If the bubble sort is top-down, then the selection sort is from the bottom up, first solving the first number, then solving the second number, and then solving the sorting of the whole array in turn.

The following is the implementation of the entire code

# include # include / / the swap exchange function using namespace std;int main () {int a [10] will be used later; / / enter the data for (int iTuno [I] > a [I];} / sort for (int itemo [I])