| ??? 08/20/05 14:19 Read: times |
#99732 - Note taken Responding to: ???'s previous message |
My vote went to Graham's solution. I saw in it a solution both fast and small allthough it might not have been the absolute fastest.
The reason you find the "reference code" in compilers/libraries is probably it's size: <20 vs. >60 bytes. |
| Topic | Author | Date |
| First challenge done, new challenge up | 01/01/70 00:00 | |
| Seems about right to me... | 01/01/70 00:00 | |
| 2 weeks? | 01/01/70 00:00 | |
| re:challenge | 01/01/70 00:00 | |
| "move the data intelligently" | 01/01/70 00:00 | |
| re: | 01/01/70 00:00 | |
| Overlapping data is part of the challeng | 01/01/70 00:00 | |
| Yep! | 01/01/70 00:00 | |
| Should work | 01/01/70 00:00 | |
| And the Winner is... | 01/01/70 00:00 | |
| A worthy winner | 01/01/70 00:00 | |
| Yes | 01/01/70 00:00 | |
| one + one | 01/01/70 00:00 | |
| Note taken | 01/01/70 00:00 | |
| tradeoff | 01/01/70 00:00 | |
| exec time and size | 01/01/70 00:00 | |
| exec time and size II | 01/01/70 00:00 | |
| Public domain.... | 01/01/70 00:00 | |
Open source? | 01/01/70 00:00 |