Timeline for Find all the Solutions to this Number Puzzle in the Shortest Time Possible
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jul 22, 2016 at 18:16 | comment | added | Andrew Epstein |
@edc65, I took the liberty of using dumbbench to test your original version vs. the bitshift version. Here are the results: Indexing: 0.2253 +/- 5.7590e-05 Bitshifting: 0.2093 +/- 6.6595e-05 So, approximately a 16ms speedup on my machine. The command I used was: dumbbench --precision=.01 -vvv --initial=500 ./solve
|
|
| Jul 21, 2016 at 7:03 | comment | added | edc65 | @AndrewEpstein it could even become slower - bitshift vs indexing | |
| Jul 21, 2016 at 0:58 | comment | added | Andrew Epstein |
@edc65, FYI you can replace int inuse[16]; with just int inuse; and then use bitwise operators to manipulate it. It doesn't seem to increase the speed that much, but it helps a little.
|
|
| May 22, 2016 at 19:15 | comment | added | Xirema | Holy sweet Evil Vampiric Jesus, those nested for loops. I bet that made your compiler really happy though. XD | |
| May 21, 2016 at 14:10 | history | answered | edc65 | CC BY-SA 3.0 |