From 1c6cd9438685a339e663ade5e74e542615d4d653 Mon Sep 17 00:00:00 2001
From: paarthibank <63107117+paarthibank@users.noreply.github.com>
Date: Mon, 19 Oct 2020 22:11:40 +0530
Subject: [PATCH] Added cycle sort in c++

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

diff --git a/Cpp/CycleSort.cpp b/Cpp/CycleSort.cpp
new file mode 100644
index 0000000..206daf9
--- /dev/null
+++ b/Cpp/CycleSort.cpp
@@ -0,0 +1,58 @@
+#include<iostream> 
+#include<stdio.h>
+using namespace std; 
+void sort(int arr[], int n) 
+{ 
+    int writes = 0; 
+    for (int cycle_start = 0; cycle_start < n - 1; cycle_start++) {
+        int item = arr[cycle_start]; 
+        int pos = cycle_start; 
+        for (int i = cycle_start + 1; i < n; i++) 
+            if (arr[i] < item) 
+                pos++;   
+        if (pos == cycle_start) 
+            continue; 
+        while (item == arr[pos]) 
+            pos += 1; 
+  
+        if (pos != cycle_start) { 
+            swap(item, arr[pos]); 
+            writes++; 
+        } 
+  
+        while (pos != cycle_start) { 
+            pos = cycle_start; 
+  
+            for (int i = cycle_start + 1; i < n; i++) 
+                if (arr[i] < item) 
+                    pos += 1; 
+  
+            while (item == arr[pos]) 
+                pos += 1; 
+   
+            if (item != arr[pos]) { 
+                swap(item, arr[pos]); 
+                writes++; 
+            } 
+        } 
+    } 
+} 
+  
+int main() 
+{ 	
+	int f;
+    cout<<"Enter length of array ";
+    cin>>f;
+    int arr[f];
+    cout<<"Enter array"<<endl;
+    for(int i=0;i<f;i++){
+    	cin>>arr[i];
+	}
+    sort(arr, f); 
+  
+    cout << "Sorted array: " << endl; 
+    for (int i = 0; i < f; i++) 
+        cout << arr[i] << " "; 
+    return 0; 
+} 
+