### C++: Selection sort using STL

Selection sort is an sorting algorithm. It has O(

It divides the input list or the array in two parts:

1. Sorted array

2. Unsorted array

The minimum element from the unsorted array is picked and placed at the end of sorted array in each iteration.

*n*2) time complexity. It has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.It divides the input list or the array in two parts:

1. Sorted array

2. Unsorted array

The minimum element from the unsorted array is picked and placed at the end of sorted array in each iteration.