From 48c4c073bb66b50f0f93363a2580171fd2ea5255 Mon Sep 17 00:00:00 2001 From: Lajat5 <64376519+Lazeeez@users.noreply.github.com> Date: Thu, 7 Oct 2021 03:59:57 +0530 Subject: [PATCH] Update sorting/selection_sort_iterative.cpp Co-authored-by: David Leal --- sorting/selection_sort_iterative.cpp | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/sorting/selection_sort_iterative.cpp b/sorting/selection_sort_iterative.cpp index ebe334dae..6c0167aff 100644 --- a/sorting/selection_sort_iterative.cpp +++ b/sorting/selection_sort_iterative.cpp @@ -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 *