algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add doctest for QuickSort and MergeSort (#502)

Browse Source 
* Add doctest for QuickSort

* Add doctest for MergeSort

Co-authored-by: Sukhpreet Sekhon <ssekhon@atb.com>
This commit is contained in:
Sukhpreet K Sekhon
2020-10-24 09:33:55 -06:00
committed by GitHub
parent da28942bd6
commit 6c2f83b752
2 changed files with 35 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
Sorts/MergeSort.js
View File

@ -13,6 +13,27 @@
* @param {Array} list2 - sublist to break down
* @return {Array} merged list
*/
/*
* Doctests
* > merge([5, 4],[ 1, 2, 3])
* [1, 2, 3, 5, 4]
* > merge([],[1, 2])
* [1, 2]
* > merge([1, 2, 3], [1])
* [1, 1, 2, 3]
* > merge([], [])
* []
*
* > mergeSort([5, 4])
* [4, 5]
* > mergeSort([8, 4, 10, 15, 9])
* [4, 8, 9, 10, 15]
* > mergeSort([1, 2, 3])
* [1, 2, 3]
* > mergeSort([ ])
* [ ]
*/
function merge (list1, list2) {
var results = []

14
Sorts/QuickSort.js
View File

@ -2,6 +2,20 @@
* Quick sort is a comparison sorting algorithm that uses a divide and conquer strategy.
* For more information see here: https://en.wikipedia.org/wiki/Quicksort
*/
/*
* Doctests
*
* > quickSort([5, 4, 3, 10, 2, 1])
* [1, 2, 3, 4, 5, 10]
* > quickSort([])
* []
* > quickSort([5, 4])
* [4, 5]
* > quickSort([1, 2, 3])
* [1, 2, 3]
*/
function quickSort (items) {
var length = items.length