An array A[0..n - 2] contains `n-1` integers from 1 to `n` in increasing order. (Thus one integer in this range is missing.) Des
1 answer:
You might be interested in
Well, you didn't say what language, so here's in Java:
public static void PrintShampooInstructions(int numCycles)
{
if(numCycles < 1)
System.out.println("Too few.");
else if (numCycles > 4)
System.out.println("Too many.");
else
{
for(int i = 1; i <= numCycles; i++)
{
System.out.println(i+": Lather and rinse.");
}
System.out.println("Done.");
}
}
And also in an image, in case you can't really see it
