Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

16
  • \$\begingroup\$ how does your algorithm work like ? \$\endgroup\$ Commented Jun 23, 2015 at 18:28
  • \$\begingroup\$ I run into a Segmentation fault: 11 when I ran this (even for small CAs). \$\endgroup\$ Commented Jun 23, 2015 at 19:57
  • \$\begingroup\$ @Thomas Oltmann I have an algorithm similar in my head, please try to explain more to avoid putting same algorithm \$\endgroup\$ Commented Jun 23, 2015 at 20:30
  • \$\begingroup\$ @Ryan i ran it here with stdin input without using files and gave me this result for ca.2.2^2000.txt: Success time: 0.68 memory: 2144 signal:0 Valid! \$\endgroup\$ Commented Jun 23, 2015 at 21:48
  • 1
    \$\begingroup\$ @Ryan I'm currently trying to find the most memory wasting arrays via gdb and valgrind. :) \$\endgroup\$ Commented Jun 24, 2015 at 13:31