backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-02 10:12:45 +08:00
Code Issues Projects Releases Wiki Activity

fix: Various LGTM fixes

Browse Source
This commit is contained in:
Panquesito7
2020-06-23 14:35:13 -05:00
parent 7393d88811
commit 0356a9cdf3
4 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sorting/bead_sort.cpp
View File

@@ -14,7 +14,7 @@ void beadSort(int *a, int len) {
// allocating memory
unsigned char *beads = new unsigned char[max * len];
memset(beads, 0, max * len);
memset(beads, 0, static_cast<size_t>(max) * len);
// mark the beads
for (int i = 0; i < len; i++)

6
sorting/comb_sort.cpp
View File

@@ -14,7 +14,7 @@ int FindNextGap(int x) {
return std::max(1, x);
}
void CombSort(int a[], int l, int r) {
void CombSort(int b[], int l, int r) {
// Init gap
int gap = n;
@@ -30,8 +30,8 @@ void CombSort(int a[], int l, int r) {
// Compare all elements with current gap
for (int i = l; i <= r - gap; ++i) {
if (a[i] > a[i + gap]) {
std::swap(a[i], a[i + gap]);
if (b[i] > b[i + gap]) {
std::swap(b[i], b[i + gap]);
swapped = true;
}
}