backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-09 07:32:54 +08:00
Code Issues Projects Releases Wiki Activity

clang-format and clang-tidy fixes for 4681e4f7

Browse Source
This commit is contained in:
github-actions
2021-10-06 19:54:48 +00:00
parent 626849eca3
commit d389d80b1c
1 changed files with 37 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

72
sorting/selection_sort_iterative.cpp
View File

@@ -4,15 +4,15 @@
*sort](https://en.wikipedia.org/wiki/Selection_sort) implementation using
*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.
* 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.
*
* ### Implementation
*
@@ -37,29 +37,29 @@
*******************************************************************************/
namespace sorting {
/******************************************************************************
* @brief The main function which implements Selection sort
* @param arr vector to be sorted:-> template
* @param len length of vector to be sorted
* @returns void
*******************************************************************************/
template <typename T>
void selectionSort(std::vector<T> &arr, uint64_t len) {
for (auto it = 0; it < len; ++it) {
int64_t min = it; // set min value
for (auto it2 = it + 1; it2 < len + 1; ++it2) {
if (arr[it2] < arr[min]) { // check which element is smaller
min = it2; // store index of smallest element to min
}
}
if (min != it) { // swap if min does not match to i
int64_t tmp = arr[min];
arr[min] = arr[it];
arr[it] = tmp;
/******************************************************************************
* @brief The main function which implements Selection sort
* @param arr vector to be sorted:-> template
* @param len length of vector to be sorted
* @returns void
*******************************************************************************/
template <typename T>
void selectionSort(std::vector<T> &arr, uint64_t len) {
for (auto it = 0; it < len; ++it) {
int64_t min = it; // set min value
for (auto it2 = it + 1; it2 < len + 1; ++it2) {
if (arr[it2] < arr[min]) { // check which element is smaller
min = it2; // store index of smallest element to min
}
}
if (min != it) { // swap if min does not match to i
int64_t tmp = arr[min];
arr[min] = arr[it];
arr[it] = tmp;
}
}
}
} // namespace sorting
/*******************************************************************************
@@ -69,7 +69,7 @@ namespace sorting {
static void test() {
// testcase #1
// [1, 0, 0, 1, 1, 0, 2, 1] returns [0, 0, 0, 1, 1, 1, 1, 2]
std::vector<int64_t> vector1 = {1, 0, 0, 1, 1, 0, 2, 1};
std::vector<int64_t> vector1 = {1, 0, 0, 1, 1, 0, 2, 1};
uint64_t vector1size = vector1.size();
std::cout << "1st test... ";
sorting::selectionSort(vector1, vector1size);
@@ -77,8 +77,9 @@ static void test() {
std::cout << "Passed" << std::endl;
// testcase #2
// [19, 22, 540, 241, 156, 140, 12, 1] returns [1, 12, 19, 22, 140, 156, 241,540]
std::vector<int64_t> vector2 = {19, 22, 540, 241, 156, 140, 12, 1};
// [19, 22, 540, 241, 156, 140, 12, 1] returns [1, 12, 19, 22, 140, 156,
// 241,540]
std::vector<int64_t> vector2 = {19, 22, 540, 241, 156, 140, 12, 1};
uint64_t vector2size = vector2.size();
std::cout << "2nd test... ";
sorting::selectionSort(vector2, vector2size);
@@ -87,7 +88,7 @@ static void test() {
// testcase #3
// [11, 20, 30, 41, 15, 60, 82, 15] returns [11, 15, 15, 20, 30, 41, 60, 82]
std::vector<int64_t> vector3 = {11, 20, 30, 41, 15, 60, 82, 15};
std::vector<int64_t> vector3 = {11, 20, 30, 41, 15, 60, 82, 15};
uint64_t vector3size = vector3.size();
std::cout << "3rd test... ";
sorting::selectionSort(vector3, vector3size);
@@ -95,8 +96,9 @@ static void test() {
std::cout << "Passed" << std::endl;
// testcase #4
// [1, 9, 11, 546, 26, 65, 212, 14, -11] returns [-11, 1, 9, 11, 14, 26, 65, 212, 546]
std::vector<int64_t> vector4 = {1, 9, 11, 546, 26, 65, 212, 14, -11};
// [1, 9, 11, 546, 26, 65, 212, 14, -11] returns [-11, 1, 9, 11, 14, 26, 65,
// 212, 546]
std::vector<int64_t> vector4 = {1, 9, 11, 546, 26, 65, 212, 14, -11};
uint64_t vector4size = vector2.size();
std::cout << "4th test... ";
sorting::selectionSort(vector4, vector4size);