diff --git a/CountSort/count_sort.cpp b/CountSort/count_sort.cpp
new file mode 100644
index 0000000..093ad13
--- /dev/null
+++ b/CountSort/count_sort.cpp
@@ -0,0 +1,38 @@
+#include<iostream>
+using namespace std;
+
+void countSort(int arr[],int n){
+    int k=arr[0];
+    for(int i=0;i<n;i++){
+        k=max(k,arr[i]);
+    }
+
+    int count[10]={0};
+    for(int i=0;i<n;i++){
+        count[arr[i]]++;
+    }
+
+    for(int i=1;i<=k;i++){
+        count[i]+=count[i-1];
+    }
+
+    int output[n];
+    for(int i=n-1;i>=0;i--){
+        output[--count[arr[i]]]=arr[i];
+    }
+
+    for(int i=0;i<n;i++){
+        arr[i]=output[i];
+    }
+}
+
+int main(){
+    int arr[]={1,3,2,3,4,1,6,4,3};
+    countSort(arr,9);
+
+    for(int i=0;i<9;i++){
+        cout<<arr[i]<<" ";
+    }
+
+    return 0;
+}
\ No newline at end of file
diff --git a/CountSort/count_sort.md b/CountSort/count_sort.md
new file mode 100644
index 0000000..43f7b8e
--- /dev/null
+++ b/CountSort/count_sort.md
@@ -0,0 +1,2 @@
+# Count Sort Algorithm
+Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values, then doing some arithmetic to calculate the position of each object in the output sequence.
\ No newline at end of file