diff --git a/Quick Sort.cpp b/Quick Sort.cpp
new file mode 100644
index 00000000..837f3fb0
--- /dev/null
+++ b/Quick Sort.cpp	
@@ -0,0 +1,49 @@
+#include<bits/stdc++.h>
+using namespace std;
+void swap(int arr[],int i,int j)
+    {
+        int temp=arr[i];
+        arr[i]=arr[j];
+        arr[j]=temp;
+    }
+int partition(int arr[],int l,int r)
+    {
+        int pivot=arr[r];
+        int i=l-1;
+        for(int j=l;j<r;j++)
+        {
+            if(arr[j]<pivot)
+            {
+                i++;
+                swap(arr,i,j);
+            }
+        }
+        swap(arr,i+1,r);
+        return i+1;
+    }
+void quickSort(int arr[],int l,int r)
+    {
+        if(l<r)
+        {
+        	int pi=partition(arr,l,r);
+        	
+        	quickSort(arr,l,pi-1);
+        	quickSort(arr,pi+1,r);
+		}
+    }
+int main()
+{
+	int n;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	{
+		cin>>arr[i];
+	}
+	quickSort(arr,0,n-1);
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	return 0;
+}    
diff --git a/sum_of_digits.cpp b/sum_of_digits.cpp
new file mode 100644
index 00000000..2b7cbad8
--- /dev/null
+++ b/sum_of_digits.cpp
@@ -0,0 +1,15 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int n;
+    cin>>n;
+    int sum=0;
+    while(n!=0)
+    {
+        sum+=n%10;
+        n/=10;
+    }
+    cout<<sum;
+    return 0;
+}
\ No newline at end of file