diff --git a/Sorts/MergeSort.js b/Sorts/MergeSort.js
index ea1947d635..b634704cfb 100644
--- a/Sorts/MergeSort.js
+++ b/Sorts/MergeSort.js
@@ -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 = []
diff --git a/Sorts/QuickSort.js b/Sorts/QuickSort.js
index d134b89c6b..933b502caf 100644
--- a/Sorts/QuickSort.js
+++ b/Sorts/QuickSort.js
@@ -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
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy