-
-
Notifications
You must be signed in to change notification settings - Fork 46.8k
Fix markdown for normal distribution quicksort #4875
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Fix markdown for normal distribution quicksort #4875
Conversation
- MD001/heading-increment/header-increment: Heading levels should only increment by one level at a time - MD012/no-multiple-blanks: Multiple consecutive blank lines - MD026/no-trailing-punctuation: Trailing punctuation in heading - MD035/hr-style: Horizontal rule style - MD045/no-alt-text: Images should have alternate text (alt text) Conventions from https://github.com/DavidAnson/markdownlint/blob/v0.24.0/doc/Rules.md
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Clearly an improvement. Here is the original one for full view and here is the new one.
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. | ||
|
||
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. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Not so well written. Could you also improve it?
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. | ||
|
||
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 | ||
|
||
The array elements are taken from a Standard Normal Distribution , having mean = 0 and standard deviation 1. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The array elements are taken from a Standard Normal Distribution , having mean = 0 and standard deviation 1. | |
The array elements are taken from a Standard Normal Distribution, having mean = 0 and standard deviation = 1. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Add a link to Standard Normal Distribution
--- | ||
|
||
--------------------- | ||
 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Use the one in Wikimedia: https://upload.wikimedia.org/wikipedia/commons/thumb/2/25/The_Normal_Distribution.svg/1280px-The_Normal_Distribution.svg.png, which is in public domain
Co-authored-by: John Law <johnlaw.po@gmail.com>
Conventions from https://github.com/DavidAnson/markdownlint/blob/v0.24.0/doc/Rules.md
Describe your change:
Checklist:
Fixes: #{$ISSUE_NO}
.