diff --git a/sorting/quick_sort.cpp b/sorting/quick_sort.cpp
index 08db9c92e..d067fa068 100644
--- a/sorting/quick_sort.cpp
+++ b/sorting/quick_sort.cpp
@@ -27,13 +27,13 @@
 #include <iostream>
 
 /**
- * This function takes last element as pivot, places  
- * the pivot element at its correct position in sorted  
- * array, and places all smaller (smaller than pivot)  
- * to left of pivot and all greater elements to right  
- * of pivot 
+ *      This function takes last element as pivot, places  
+ *      the pivot element at its correct position in sorted  
+ *      array, and places all smaller (smaller than pivot)  
+ *      to left of pivot and all greater elements to right  
+ *      of pivot 
  *
- * */
+ */
 
 int partition(int arr[], int low, int high) {
     int pivot = arr[high];    // taking the last element as pivot