Timeline for List of first n prime numbers most efficiently and in shortest code
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2016 at 17:58 | comment | added | 0WJYxW9FMN | Thanks anyway. You've made my program the shortest one here! | |
| Oct 12, 2016 at 17:30 | comment | added | acrolith | No, sorry. (Comments have to be at least 15 chars long) | |
| Oct 12, 2016 at 17:23 | comment | added | 0WJYxW9FMN | @daHugLenny Would you know how to calculate efficiency by any chance? | |
| Oct 12, 2016 at 17:19 | history | edited | 0WJYxW9FMN | CC BY-SA 3.0 |
I put the wrong number of bytes. Fixed.
|
| Oct 12, 2016 at 17:10 | history | edited | 0WJYxW9FMN | CC BY-SA 3.0 |
Shortened the code.
|
| Oct 12, 2016 at 17:07 | comment | added | 0WJYxW9FMN | @daHugLenny Wow, thanks so much! I'll edit my post in a sec. :-D | |
| Oct 12, 2016 at 17:03 | comment | added | acrolith |
I think you can put the print(i) on the same line as the for loop and remove the spaces at in [2], 0 if, 0 in [i%j and +1,2)] else.
|
|
| Oct 12, 2016 at 16:56 | review | Late answers | |||
| Oct 12, 2016 at 18:35 | |||||
| Oct 12, 2016 at 16:38 | history | answered | 0WJYxW9FMN | CC BY-SA 3.0 |