Skip to content

Commit

Permalink
Merge pull request TheAlgorithms#129 from Balance-Breaker/master
Browse files Browse the repository at this point in the history
Fixed heading's formatting errors
  • Loading branch information
harshildarji authored Nov 28, 2017
2 parents a03b2ea + 1f0f4b2 commit 491439a
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions sorts/normal_distribution_QuickSort_README.md
Original file line number Diff line number Diff line change
@@ -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

Expand Down Expand Up @@ -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
Expand Down

0 comments on commit 491439a

Please sign in to comment.