jeena/en.javascript.info
1
0
Fork 0
Code Issues Pull requests Projects Packages Wiki Activity Actions

Update solution.md

Browse source
This commit is contained in:
Alexander 2017-10-15 23:54:43 +03:00 • committed by GitHub
parent 24411a8de8
commit b202d616ec
1 changed files with 8 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

16
1-js/05-data-types/05-array-methods/9-shuffle/solution.md
View file

@ -33,14 +33,14 @@ let count = {
'312': 0
};
for(let i = 0; i < 1000000; i++) {
for (let i = 0; i < 1000000; i++) {
let array = [1, 2, 3];
shuffle(array);
count[array.join('')]++;
}
// show counts of all possible permutations
for(let key in count) {
for (let key in count) {
alert(`${key}: ${count[key]}`);
}
```
@ -66,8 +66,8 @@ There are other good ways to do the task. For instance, there's a great algorith
```js
function shuffle(array) {
for(let i = array.length - 1; i > 0; i--) {
let j = Math.floor(Math.random() * (i+1)); // random index from 0 to i
for (let i = array.length - 1; i > 0; i--) {
let j = Math.floor(Math.random() * (i + 1)); // random index from 0 to i
[array[i], array[j]] = [array[j], array[i]]; // swap elements
}
}
@ -77,8 +77,8 @@ Let's test it the same way:
```js run
function shuffle(array) {
for(let i = array.length - 1; i > 0; i--) {
let j = Math.floor(Math.random() * (i+1));
for (let i = array.length - 1; i > 0; i--) {
let j = Math.floor(Math.random() * (i + 1));
[array[i], array[j]] = [array[j], array[i]];
}
}
@ -93,14 +93,14 @@ let count = {
'312': 0
};
for(let i = 0; i < 1000000; i++) {
for (let i = 0; i < 1000000; i++) {
let array = [1, 2, 3];
shuffle(array);
count[array.join('')]++;
}
// show counts of all possible permutations
for(let key in count) {
for (let key in count) {
alert(`${key}: ${count[key]}`);
}
```