Search found 1 match
- Sun May 11, 2003 8:58 am
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 321151
Re: problem 100 (insane timings) and general tricks
Hi!
I even wonder how it is possible to reach a tiime 0.0.0. My algorithm spent 0.164 s and 508k and I can't find a way to improve it, except enlarging the array memory. I post it hoping someone could help me.
I saw alot of things in your code. Non-dynamic arrays in C++ are automatically ...