Timeline for Output a random unary string
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 30, 2024 at 23:14 | history | edited | l4m2 | CC BY-SA 4.0 | added 4 characters in body |
| Jan 30, 2024 at 19:30 | comment | added | noodle person | 29 bytes using ''.padEnd(n) instead of 'x'.repeat(n) | |
| Mar 20, 2022 at 15:52 | comment | added | The Fifth Marshal | @MatthewJensen We generally don't care about practical issues like recursion limits | |
| Mar 15, 2022 at 23:30 | comment | added | Matthew Jensen | Would the first one be invalid due to max recursion depth? Or is it fine because it's implementation specific, not in the JS standard? | |
| Mar 3, 2022 at 13:52 | comment | added | Neil | I would have used <.5 as that would have given an exact 50% probability of recursion. | |
| Mar 3, 2022 at 10:19 | comment | added | CreaZyp154 | @EnderShadow8 ah yes, didn't see | |
| Mar 3, 2022 at 10:11 | comment | added | EnderShadow8 | @CreaZyp154 It's required for recursion | |
| Mar 3, 2022 at 7:47 | comment | added | CreaZyp154 | you can also omit the f= on the first one | |
| Mar 2, 2022 at 3:39 | comment | added | tsh | Math.random() may output 0. So you may omit the >.5 in first program. | |
| Mar 1, 2022 at 12:04 | history | edited | l4m2 | CC BY-SA 4.0 | added 401 characters in body |
| Mar 1, 2022 at 11:55 | comment | added | ophact | AH! Beat me to it, was thinking of this ever since I first saw it in the sandbox | |
| Mar 1, 2022 at 11:53 | history | answered | l4m2 | CC BY-SA 4.0 |