Timeline for How fast were BASIC interpreters in the 80s? (Is this optimization for speed really necessary?)
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 23, 2021 at 13:58 | history | edited | user3840170 | CC BY-SA 4.0 | added 53 characters in body |
| Jun 23, 2021 at 13:29 | comment | added | introspec | Thank you very much for performing the computational complexity analysis, which was sorely missing in this discussion. It does not matter how fast is the computer for which you are writing your code; the "simpler" code by the OP would choke for much smaller N, because it does not apply the correct algorithm for generating permutations. | |
| Jun 21, 2021 at 22:06 | review | First posts | |||
| Jun 21, 2021 at 22:09 | |||||
| Jun 21, 2021 at 21:55 | history | answered | Geardaddy | CC BY-SA 4.0 |