Timeline for Repeat every other character in string starting with second character
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2020 at 21:13 | comment | added | user76284 | @Mathgeek CPU failure is not usually a consideration for code golf, whereas program determinism is. And the expected runtime for Bogosort is O(n!), not O(2^n). | |
| Feb 14, 2020 at 14:23 | comment | added | Mathgeek | I don't necessarily agree with the "infinite time and memory" because BOGO sorting would be "allowed", which would be ridiculous. Imagine if a "check if a string is an anagram of another string" formula was "shuffle the second string, compare, and continue if unequal. If 2^n days have passed, where n is the length of the string, consider the strings non-anagrams". It would have an error rate less than the expected failure of a CPU while running a typical program. | |
| Feb 1, 2020 at 10:03 | comment | added | Shaggy | You may assume infinite time and memory for the purposes of code golf. | |
| Feb 1, 2020 at 5:05 | history | edited | Daniel Cristofani | CC BY-SA 4.0 |
Another version.
|
| Feb 1, 2020 at 5:00 | history | edited | Daniel Cristofani | CC BY-SA 4.0 |
Another version.
|
| S Feb 1, 2020 at 2:03 | history | suggested | RGS | CC BY-SA 4.0 |
include TIO link
|
| Feb 1, 2020 at 1:51 | review | Suggested edits | |||
| S Feb 1, 2020 at 2:03 | |||||
| Feb 1, 2020 at 1:20 | history | answered | Daniel Cristofani | CC BY-SA 4.0 |