Skip to content

Commit 491439a

Browse files
authored
Merge pull request TheAlgorithms#129 from Balance-Breaker/master
Fixed heading's formatting errors
2 parents a03b2ea + 1f0f4b2 commit 491439a

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

sorts/normal_distribution_QuickSort_README.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -1,15 +1,15 @@
1-
#Normal Distribution QuickSort
1+
# Normal Distribution QuickSort
22

33

44
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.
55
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.
66

77

8-
##Array Elements
8+
## Array Elements
99

1010
The array elements are taken from a Standard Normal Distribution , having mean = 0 and standard deviation 1.
1111

12-
####The code
12+
#### The code
1313

1414
```python
1515

@@ -52,7 +52,7 @@ The array elements are taken from a Standard Normal Distribution , having mean =
5252

5353
--
5454

55-
##Plotting the function for Checking 'The Number of Comparisons' taking place between Normal Distribution QuickSort and Ordinary QuickSort
55+
## Plotting the function for Checking 'The Number of Comparisons' taking place between Normal Distribution QuickSort and Ordinary QuickSort
5656

5757
```python
5858
>>>import matplotlib.pyplot as plt

0 commit comments

Comments
 (0)