From f73de70829c3ccbf81bfe9aa99cec20e1705527a Mon Sep 17 00:00:00 2001
From: AnupamaTK <43145867+AnupamaTK@users.noreply.github.com>
Date: Wed, 12 May 2021 14:28:28 +0530
Subject: [PATCH 1/2] Create Combosort.cpp

---
 Cpp/Combosort.cpp | 38 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 38 insertions(+)
 create mode 100644 Cpp/Combosort.cpp

diff --git a/Cpp/Combosort.cpp b/Cpp/Combosort.cpp
new file mode 100644
index 0000000..88cdf15
--- /dev/null
+++ b/Cpp/Combosort.cpp
@@ -0,0 +1,38 @@
+#include<bits/stdc++.h> 
+using namespace std; 
+
+int Comb_Sort(int arr[], int n) 
+{ 
+  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; 
+} 

From dbe2cb240f4ff868887709e7e8e4f9d9db1b3ef0 Mon Sep 17 00:00:00 2001
From: AnupamaTK <43145867+AnupamaTK@users.noreply.github.com>
Date: Sat, 15 May 2021 21:32:48 +0530
Subject: [PATCH 2/2] Update and rename Combosort.cpp to Combsort.cpp

---
 Cpp/{Combosort.cpp => Combsort.cpp} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename Cpp/{Combosort.cpp => Combsort.cpp} (95%)

diff --git a/Cpp/Combosort.cpp b/Cpp/Combsort.cpp
similarity index 95%
rename from Cpp/Combosort.cpp
rename to Cpp/Combsort.cpp
index 88cdf15..0a844ac 100644
--- a/Cpp/Combosort.cpp
+++ b/Cpp/Combsort.cpp
@@ -1,7 +1,7 @@
 #include<bits/stdc++.h> 
 using namespace std; 
 
-int Comb_Sort(int arr[], int n) 
+int CombSort(int arr[], int n) 
 { 
   int gap = n;