GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/String/CreatePermutations.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathCreatePermutations.jsMore file actions 38 lines (33 loc) · 1.05 KB / Copy pathCreatePermutations.jsFile metadata and controls38 lines (33 loc) · 1.05 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 /* 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 } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |