Merge pull request #28 from eyas-ranjous/development

v3.0.9

CHANGELOG.md

@@ -6,6 +6,10 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [3.0.9] - 2020-05-01
+### Fixed
+- README
+
 ## [3.0.8] - 2020-05-01
 ### Fixed
 - README

README.md

@@ -22,7 +22,7 @@ Sort Algorithms implementation in javascript with ability to use a comparison ca
     * [mergeSort(list, compare)](#mergeSortlist-compare)
   * [benchmark](#benchmark) ⭐
  * [Build](#build)
- * [Collaboration](#collaboration) 🤝
+ * [Contribution](#contribution) 🤝
  * [License](#license)
 
 ## Implemented Algorithms
@@ -381,8 +381,8 @@ and I took the best and worst recorded time of each 10 iterations. the result wa
 grunt build
 ```
 
-## Collaboration
-If you have some ideas to improve the implemented algorithms or add new ones, feel free to fork the repo to your github and push your code. It just has to be consistent with the existing code structure and style, as well as tests and README. Once done, please open a PR from development branch. Thanks 🌠
+## Contribution
+If you'd like to contribute to the project to improve the existing algorithms or implement new ones, feel free to fork the repo in your github and push your code. It just needs to be consistent with the existing code structure and style, as well as tests and README. Once done, please open a PR from development branch. Thanks 🌠
 
-### License
+## License
 The MIT License. Full License is [here](https://github.com/eyas-ranjous/sort-algorithms-js/blob/master/LICENSE)

package.json

@@ -1,6 +1,6 @@
 {
   "name": "sort-algorithms-js",
-  "version": "3.0.8",
+  "version": "3.0.9",
   "description": "production-ready sort algorithms implementation in javascript.",
   "main": "index.js",
   "directories": {