backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-12 11:37:18 +08:00
Code Issues Projects Releases Wiki Activity

Reworked on changes.

Browse Source
This commit is contained in:
Lajat5
2021-10-21 17:31:37 +00:00
parent bcf294bae5
commit f89321a8f1
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
sorting/selection_sort_iterative.cpp
View File

@@ -46,7 +46,7 @@ namespace sorting {
template <typename T> template <typename T>
void selectionSort(std::vector<T> &arr, uint64_t len) { void selectionSort(std::vector<T> &arr, uint64_t len) {
for (uint64_t it = 0; it < len; ++it) { for (uint64_t it = 0; it < len; ++it) {
int64_t min = it; // set min value uint64_t min = it; // set min value
for (uint64_t it2 = it + 1; it2 < len + 1; ++it2) { for (uint64_t it2 = it + 1; it2 < len + 1; ++it2) {
if (arr[it2] < arr[min]) { // check which element is smaller if (arr[it2] < arr[min]) { // check which element is smaller
min = it2; // store index of smallest element to min min = it2; // store index of smallest element to min
@@ -54,7 +54,7 @@ void selectionSort(std::vector<T> &arr, uint64_t len) {
} }
if (min != it) { // swap if min does not match to i if (min != it) { // swap if min does not match to i
int64_t tmp = arr[min]; uint64_t tmp = arr[min];
arr[min] = arr[it]; arr[min] = arr[it];
arr[it] = tmp; arr[it] = tmp;
} }