diff --git a/sorts/normal_distribution_QuickSort_README.md b/sorts/normal_distribution_QuickSort_README.md
index d56f934ccfe9..635262bfdf7d 100644
--- a/sorts/normal_distribution_QuickSort_README.md
+++ b/sorts/normal_distribution_QuickSort_README.md
@@ -1,15 +1,15 @@
-#Normal Distribution QuickSort
+# Normal Distribution QuickSort
 
 
 Algorithm implementing QuickSort Algorithm where the pivot element is chosen randomly between first and last elements of the array and the array elements are taken from a Standard Normal Distribution.
 This is different from the ordinary quicksort in the sense, that it applies more to real life problems , where elements usually follow a normal distribution. Also the pivot is randomized to make it a more generic one.
 
 
-##Array Elements
+## Array Elements
 
 The array elements are taken from a Standard Normal Distribution , having mean = 0 and standard deviation 1.
 
-####The code
+#### The code
 
 ```python
 
@@ -52,7 +52,7 @@ The array elements are taken from a Standard Normal Distribution , having mean =
 
 --
 
-##Plotting the function for Checking 'The Number of Comparisons' taking place between Normal Distribution QuickSort and Ordinary QuickSort 
+## Plotting the function for Checking 'The Number of Comparisons' taking place between Normal Distribution QuickSort and Ordinary QuickSort 
 
 ```python
 >>>import matplotlib.pyplot as plt