diff --git a/Quick sort/Basic Questions/Sorting an array using Quick Sort.cpp b/Quick sort/Basic Questions/Sorting an array using Quick Sort.cpp
new file mode 100644
index 0000000..c07b0df
--- /dev/null
+++ b/Quick sort/Basic Questions/Sorting an array using Quick Sort.cpp	
@@ -0,0 +1,49 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+void swap(int* a, int* b) 
+{ 
+	int t = *a; 
+	*a = *b; 
+	*b = t; 
+} 
+int partition (int arr[], int low, int high) 
+{ 
+	int pivot = arr[high];
+	int i = (low - 1);
+
+	for (int j = low; j <= high - 1; j++) 
+	{ 
+		if (arr[j] < pivot) 
+		{ 
+			i++; 
+			swap(&arr[i], &arr[j]); 
+		} 
+	} 
+	swap(&arr[i + 1], &arr[high]); 
+	return (i + 1); 
+}
+void quickSort(int arr[], int low, int high) 
+{ 
+	if (low < high) 
+	{
+		int pi = partition(arr, low, high); 
+		quickSort(arr, low, pi - 1); 
+		quickSort(arr, pi + 1, high); 
+	} 
+} 
+void printArray(int arr[], int size) 
+{ 
+	int i; 
+	for (i = 0; i < size; i++) 
+		cout << arr[i] << " "; 
+	cout << endl; 
+} 
+int main() 
+{ 
+	int arr[] = {3, 25, 8, 19, 10, 5}; 
+	int n = sizeof(arr) / sizeof(arr[0]); 
+	quickSort(arr, 0, n - 1); 
+	cout << "Sorted array: \n"; 
+	printArray(arr, n); 
+	return 0; 
+}