Skip to content

Create Combosort.cpp #191

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
AnupamaTK wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Create Combosort.cpp #191

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f73de70
Create Combosort.cpp
AnupamaTK May 12, 2021
dbe2cb2
Update and rename Combosort.cpp to Combsort.cpp
AnupamaTK May 15, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 38 additions & 0 deletions Cpp/Combosort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
#include<bits/stdc++.h>
using namespace std;

int Comb_Sort(int arr[], int n)
Copy link
Copy Markdown
Owner

@diptangsu diptangsu May 15, 2021

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

why noy combSort?

{
int gap = n;

while (gap != 1)
{
gap = int(gap/1.3);
if (gap < 1)
gap= 1;

for (int i=0; i<n-gap; i++)
{
if (arr[i] > arr[i+gap])
swap(arr[i], arr[i+gap]);
}
}
}

int main()
{
int arr[] = {121, 28, 332, -656, -841, 172, 236, 110, -28, 11, 574};

int n = sizeof(arr)/sizeof(arr[0]);

Comb_Sort(arr, n);

std::cout << "Input Array" << std::endl;
std::cout << "{121, 28, 332, -656, -841, 172, 236, 110, -28, 11, 574}"<< std::endl;
std::cout << "Sorted Array" << std::endl;

for (int i=0; i<n; i++)
std::cout << arr[i] <<" ";

return 0;
}