backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-13 07:25:42 +08:00
Code Issues Projects Releases Wiki Activity

Update sorting/selection_sort_iterative.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Lajat5
2021-10-07 03:59:57 +05:30
committed by GitHub
parent 419e778b03
commit 48c4c073bb
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
sorting/selection_sort_iterative.cpp
View File

@@ -5,14 +5,14 @@
*swapping
* @details
* The selection sort algorithm divides the input vector into two parts: a
*sorted subvector of items which is built up from left to right at the front
*(left) of the vector, and a subvector of the remaining unsorted items that
*occupy the rest of the vector. Initially, the sorted subvector is empty, and
*the unsorted subvector is the entire input vector. The algorithm proceeds by
*finding the smallest (or largest, depending on the sorting order) element in
*the unsorted subvector, exchanging (swapping) it with the leftmost unsorted
*element (putting it in sorted order), and moving the subvector boundaries one
*element to the right.
* sorted subvector of items which is built up from left to right at the front
* (left) of the vector, and a subvector of the remaining unsorted items that
* occupy the rest of the vector. Initially, the sorted subvector is empty, and
* the unsorted subvector is the entire input vector. The algorithm proceeds by
* finding the smallest (or largest, depending on the sorting order) element in
* the unsorted subvector, exchanging (swapping) it with the leftmost unsorted
* element (putting it in sorted order), and moving the subvector boundaries one
* element to the right.
*
* ### Implementation
*