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

formatting source-code for d7af6fdc8c

Browse Source
This commit is contained in:
github-actions
2020-05-29 23:26:30 +00:00
parent edb3d51ec2
commit 7ad1f171c1
176 changed files with 5342 additions and 4288 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
sorting/comb_sort.cpp
View File

@@ -8,13 +8,15 @@
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;
@@ -22,15 +24,18 @@ 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;
}
@@ -38,7 +43,8 @@ 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];