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

formatting source-code for 153fb7b8a5

Browse Source
This commit is contained in:
github-actions
2020-05-30 04:02:09 +00:00
parent 92fe9495ec
commit 8a2de9842b
175 changed files with 1671 additions and 3460 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
sorting/comb_sort.cpp
View File

@@ -8,15 +8,13 @@
int a[100005];
int n;
int FindNextGap(int x)
{
int FindNextGap(int x) {
x = (x * 10) / 13;
return std::max(1, x);
}
void CombSort(int a[], int l, int r)
{
void CombSort(int a[], int l, int r) {
// Init gap
int gap = n;
@@ -24,18 +22,15 @@ void CombSort(int a[], int l, int r)
bool swapped = true;
// Keep running until gap = 1 or none elements were swapped
while (gap != 1 || swapped)
{
while (gap != 1 || swapped) {
// Find next gap
gap = FindNextGap(gap);
swapped = false;
// Compare all elements with current gap
for (int i = l; i <= r - gap; ++i)
{
if (a[i] > a[i + gap])
{
for (int i = l; i <= r - gap; ++i) {
if (a[i] > a[i + gap]) {
std::swap(a[i], a[i + gap]);
swapped = true;
}
@@ -43,8 +38,7 @@ void CombSort(int a[], int l, int r)
}
}
int main()
{
int main() {
std::cin >> n;
for (int i = 1; i <= n; ++i) std::cin >> a[i];