Merge pull request iam-abbas#360 from muskan077/c++

Comb_sort.cpp

Author: probot-auto-merge[bot]

Sorting Algorithm/comb_sort.cpp

@@ -0,0 +1,63 @@
+// C++ implementation of Comb Sort 
+#include<bits/stdc++.h> 
+using namespace std; 
+
+// To find gap between elements 
+int getNextGap(int gap) 
+{ 
+	// Shrink gap by Shrink factor 
+	gap = (gap*10)/13; 
+
+	if (gap < 1) 
+		return 1; 
+	return gap; 
+} 
+
+// Function to sort a[0..n-1] using Comb Sort 
+void combSort(int a[], int n) 
+{ 
+	// Initialize gap 
+	int gap = n; 
+
+	// Initialize swapped as true to make sure that 
+	// loop runs 
+	bool swapped = true; 
+
+	// Keep running while gap is more than 1 and last 
+	// iteration caused a swap 
+	while (gap != 1 || swapped == true) 
+	{ 
+		// Find next gap 
+		gap = getNextGap(gap); 
+
+		// Initialize swapped as false so that we can 
+		// check if swap happened or not 
+		swapped = false; 
+
+		// Compare all elements with current gap 
+		for (int i=0; i<n-gap; i++) 
+		{ 
+			if (a[i] > a[i+gap]) 
+			{ 
+				swap(a[i], a[i+gap]); 
+				swapped = true; 
+			} 
+		} 
+	} 
+} 
+
+// Driver program 
+int main() 
+{ 
+	int a[] = {8, 4, 1, 56, 3, -44, 23, -6, 28, 0}; 
+	int n = sizeof(a)/sizeof(a[0]); 
+
+	combSort(a, n); 
+
+	printf("Sorted array: \n"); 
+	for (int i=0; i<n; i++) 
+		printf("%d ", a[i]); 
+
+	return 0; 
+} 
+