Skip to content

Improved Bead Sort representation #553

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.

Sign up for GitHub

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

Merged
marsonya merged 3 commits into from
Dec 30, 2020
Merged

Improved Bead Sort representation #553

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
c67a570
improved doctests presentation
marsonya Dec 22, 2020
a3e6c4c
formatted implementation
marsonya Dec 25, 2020
2acff23
improved comments and algo description
marsonya Dec 30, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 32 additions & 19 deletions Sorts/BeadSort.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,30 +1,34 @@
/**
* Bead sort (also known as Gravity sort)
* https://en.wikipedia.org/wiki/Bead_sort
* Bead Sort, also known as Gravity sort, this algorithm was
* inspired from natural phenomenons and was designed keeping in mind objects(or beads)
* falling under the influence of gravity.
*
* Does counting sort of provided array according to
* the digit represented by exp.
* Only works for arrays of positive integers.
* NOTE: It only works for arrays of positive integers.
*
* Wikipedia: https://en.wikipedia.org/wiki/Bead_sort
*/

// > beadSort([-1, 5, 8, 4, 3, 19])
// ! RangeError: Sequence must be a list of positive integers!
// > beadSort([5, 4, 3, 2, 1])
// [1, 2, 3, 4, 5]
// > beadSort([7, 9, 4, 3, 5])
// [3, 4, 5, 7, 9]
/**
* Doctests
*
* > beadSort([5, 4, 3, 2, 1])
* [1, 2, 3, 4, 5]
* > beadSort([7, 9, 4, 3, 5])
* [3, 4, 5, 7, 9]
* > beadSort([-1, 5, 8, 4, 3, 19])
* ! RangeError: Sequence must be a list of positive integers!
*/

function beadSort (sequence) {
// first, let's check that our sequence consists
// of positive integers
/* Let's ensure our sequence has only Positive Integers */
if (sequence.some((integer) => integer < 0)) {
throw RangeError('Sequence must be a list of positive integers!')
throw RangeError('Sequence must be a list of Positive integers Only!')
}

const sequenceLength = sequence.length
const max = Math.max(...sequence)

// set initial grid
// Set initial Grid
const grid = sequence.map(number => {
const maxArr = new Array(max)

Expand All @@ -35,7 +39,7 @@ function beadSort (sequence) {
return maxArr
})

// drop the beads!
// Drop the Beads!
for (let col = 0; col < max; col++) {
let beadsCount = 0

Expand All @@ -55,7 +59,7 @@ function beadSort (sequence) {
}
}

// and, finally, let's turn our bead rows into their respective numbers
/* Finally, let's turn our Bead rows into their Respective Numbers */
const sortedSequence = grid.map((beadArray) => {
const beadsArray = beadArray.filter(bead => bead === '*')

Expand All @@ -65,5 +69,14 @@ function beadSort (sequence) {
return sortedSequence
}

// implementation
console.log(beadSort([5, 4, 3, 2, 1]))
/**
* Implementation of Bead Sort
*/
const array = [5, 4, 3, 2, 1]
// Before Sort
console.log('\n- Before Sort | Implementation of Bead Sort -')
console.log(array)
// After Sort
console.log('- After Sort | Implementation of Bead Sort -')
console.log(beadSort(array))
console.log('\n')