-
Notifications
You must be signed in to change notification settings - Fork 227
/
CombSort.cpp
54 lines (44 loc) · 793 Bytes
/
CombSort.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include<bits/stdc++.h>
using namespace std;
int getNextGap(int gap)
{
gap = (gap*10)/13;
if (gap < 1)
return 1;
return gap;
}
void combSort(int a[], int n)
{
int gap = n;
bool swapped = true;
while (gap != 1 || swapped == true)
{
gap = getNextGap(gap);
swapped = false;
for (int i=0; i<n-gap; i++)
{
if (a[i] > a[i+gap])
{
swap(a[i], a[i+gap]);
swapped = true;
}
}
}
}
int main()
{
printf("\n\t\tCOMB SORT\n\n");
int arr[] = {23, 78, 1, 56, 3, 2345, 23, 45, 28, 209};
int n = sizeof(arr)/sizeof(arr[0]);
printf("\nArray Before Sorting is: ");
for(int i=0;i<n;i++){
printf("%d ",arr[i]);
}
combSort(arr, n);
printf("\nArray after Sorting: \n");
for (int i=0; i<n; i++){
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}