algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 01:18:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

improved doctests presentation

Browse Source
This commit is contained in:
marsonya
2020-12-22 23:58:40 +05:30
parent 80c2dc85d7
commit c67a570c45
1 changed files with 10 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
Sorts/BeadSort.js
View File

@ -7,12 +7,16 @@
* Only works for arrays of positive integers. * Only works for arrays of positive integers.
*/ */
// > beadSort([-1, 5, 8, 4, 3, 19]) /**
// ! RangeError: Sequence must be a list of positive integers! * Doctests
// > beadSort([5, 4, 3, 2, 1]) *
// [1, 2, 3, 4, 5] * > beadSort([-1, 5, 8, 4, 3, 19])
// > beadSort([7, 9, 4, 3, 5]) * ! RangeError: Sequence must be a list of positive integers!
// [3, 4, 5, 7, 9] * > beadSort([5, 4, 3, 2, 1])
* [1, 2, 3, 4, 5]
* > beadSort([7, 9, 4, 3, 5])
* [3, 4, 5, 7, 9]
*/
function beadSort (sequence) { function beadSort (sequence) {
// first, let's check that our sequence consists // first, let's check that our sequence consists