The 3n + 1 problem
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 53448 | Accepted: 16999 |
Description
Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
Consider the following algorithm:
Consider the following algorithm: