Question: Hailstone sequence Given a positive integer n , the following rules will always create a sequence that ends with 1 , called the hailstone sequence:

Hailstone sequence
Given a positive integer n, the following rules will always create a sequence that ends with 1, called the hailstone sequence:
If n is even, divide it by two
If n is odd, multiply it by 3 and add 1(i.e.3n +1)
Continue until n is 1
Write a program that reads an integer as input and prints the hailstone sequence starting with the integer entered. Format the output so that ten integers, each separated by a tab character (\t), are printed per line. End the last line of output with a new line (endl).
The output format can be achieved as follows:
cout n "\t";
Ex: If the input is: 25
The output is:
25763819582988442211
3417522613402010516
8421
FIX MY CODE PLEASE, SOME INPUTS HAVE ISSUES
#include
using namespace std;
int main()
{
int n, count =1;
cin >> n;
cout n "\t";
while( n >1)
{
if ( n%2==0)
n /=2;
else
n =3* n +1;
cout n "\t";
++count;
if ( count %10==0)
{
cout endl;
}
}
cout endl;
}
Hailstone sequence Given a positive integer n ,

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!