Question

In this project, you will write C code to solve the Collatz conjecture using ordinary pipes to share data between parent and child processes

Here are the rules for your program:

1. The starting number will be entered on the command line. Be sure to check that it is positive.
2. The parent will handle the command line and pass the integer to the child.
3. The child will do the calculation and pass the sequence generated back to the parent.
4. The parent will invoke wait while the child is doing the calculation.
5. The parent will print out the sequence generated.

Answer 1

public static string collatz(string y)

{

if (y == null)

{

return null;

}

int x = int.Parse(y); //x is my "n"

var results = new StringBuilder();

results.Append(x.ToString());

int largest = x; //keep track of biggest number

// the algorithm

// the redundancies (like x==1.. x!= 1) are part of troubleshooting :/

while (x > 1)

{

if (x % 2 == 0)

{

x = x / 2;

if (x > largest)

{

largest = x;

}

if (x != 1)

{

results.Append(" " + x.ToString());

}

if (x == 1)

{

results.Append(" " + x.ToString());

results.Append(" largest number was " + largest.ToString());

return results.ToString();

}

}

if (x % 2 != 0)

{

if (x == 1)

{

results.Append(" " + x.ToString());

results.Append(" largest number was " + largest.ToString());

return results.ToString();

}

x = (3 * x) + 1;

if (x > largest)

{

largest = x;

}

results.Append(" " + x.ToString());

}

}

return results.ToString();

}