diff --git a/DSA_Codesheet/C/cycle_sort.c b/DSA_Codesheet/C/cycle_sort.c
new file mode 100644
index 0000000..196b13a
--- /dev/null
+++ b/DSA_Codesheet/C/cycle_sort.c
@@ -0,0 +1,77 @@
+#include<stdio.h>
+void cycleSort (int arr[], int n)
+{
+    // count number of memory writes
+    int writes = 0;
+ 
+    // traverse array elements and put it to on the right place
+    
+    for (int i=0; i<=n-2; i++)
+    {
+        int item = arr[i];
+
+        int pos = i;
+        for (int j = i+1; j<n; j++)
+            if (arr[j] < item)
+                pos++;
+ 
+        // If item is already in correct position then
+        if (pos == i)
+            continue;
+ 
+        // if it have duplicate elements
+        while (item == arr[pos])
+            pos += 1;
+ 
+        // put the item to right position
+        if (pos != i)
+        {
+                int temp=item;
+                item=arr[pos];
+                arr[pos]=temp;
+                writes++;
+        }
+ 
+        // Rotate rest of the cycle
+        while (pos !=i)
+        {
+            pos =i;
+ 
+            // for position where we put the element
+            for (int j = i+1; j<n; j++)
+                if (arr[j] < item)
+                    pos += 1;
+ 
+            //  to ignore all duplicate elements
+            while (item == arr[pos])
+                pos += 1;
+ 
+            // put the item to its right position
+            if (item != arr[pos])
+            {
+                int temp=item;
+                item=arr[pos];
+                arr[pos]=temp;
+                writes++;
+            }
+        }
+    }
+}
+ 
+
+int main()
+{
+    int arr[] = {1, 8, 3, 9, 10, 10, 2, 4 };
+    
+    int n = sizeof(arr)/sizeof(arr[0]);
+    printf("unsorted array:\n");
+    for (int j =0; j<n; j++)
+    {printf("%d ",arr[j]);
+    }
+    cycleSort(arr,  n) ;
+    printf("\n");
+    printf ("After sort : " );
+    for (int j =0; j<n; j++)
+        printf("%d ",arr[j]);
+    return 0;
+}
\ No newline at end of file