mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 08:16:50 +08:00

* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
39 lines
1.1 KiB
JavaScript
39 lines
1.1 KiB
JavaScript
/*
|
|
a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements.
|
|
The word "permutation" also refers to the act or process of changing the linear order of an ordered set
|
|
More at : https://en.wikipedia.org/wiki/Permutation
|
|
*/
|
|
|
|
const createPermutations = (str) => {
|
|
// convert string to array
|
|
const arr = str.split('')
|
|
|
|
// get array length
|
|
const strLen = arr.length
|
|
// this will hold all the permutations
|
|
const perms = []
|
|
let rest
|
|
let picked
|
|
let restPerms
|
|
let next
|
|
|
|
// if strLen is zero, return the same string
|
|
if (strLen === 0) {
|
|
return [str]
|
|
}
|
|
// loop to the length to get all permutations
|
|
for (let i = 0; i < strLen; i++) {
|
|
rest = Object.create(arr)
|
|
picked = rest.splice(i, 1)
|
|
|
|
restPerms = createPermutations(rest.join(''))
|
|
|
|
for (let j = 0, jLen = restPerms.length; j < jLen; j++) {
|
|
next = picked.concat(restPerms[j])
|
|
perms.push(next.join(''))
|
|
}
|
|
}
|
|
return perms
|
|
}
|
|
export { createPermutations }
|