// CSCI 2530 // Assignment: 2 // Author: Sherwin Slaughter // File: hailstone.cpp // Tab stops: 4 // The program reads an integer 'n' and prints the hailstone sequence // beginning with 'n' as well as the length and largest numbers in that sequence. // Additionally, it shows the length of the longest hailstone sequence beginning with a number // from 1 to 'n' and the starting value of that sequence. #include #include using namespace std; // Function Prototype Declaration. int next(int), sequence_Length(int), sequence_Max(int), sequence_Comparison(int), largestSeqStart_Num(int); void hailstone_Sequence(int); int main() { int user_Input; cout << "What number shall I start with? "; cin >> user_Input; cout << user_Input << "\n"; cout << "The hailstone sequence starting at " << user_Input << " is: " << endl; hailstone_Sequence(user_Input); cout << "\nThe length of the sequence is " << sequence_Length(user_Input); cout << ".\n"; cout << "The largest number in the sequence is " << sequence_Max(user_Input); cout << ".\n"; cout << "The longest hailstone sequence starting with a number up to " << user_Input << " has length " << sequence_Comparison(user_Input) << ".\n"; cout << "The longest hailstone sequence starting with a number up to " << user_Input << " begins with "; cout << largestSeqStart_Num(user_Input) << ".\n"; } /* // next(int n) // Returns a number that follows 'n' in the sequence. */ int next(int n) { // Only executes the function if 'n' is // greater than 1. if (n > 1) { // If 'n' is even, executes the calculation // below, returning the value. if ((n % 2) == 0) { return n / 2; } // If 'n' is odd, executes the calculation // below, returning the value. else { return 3 * n + 1; } } return n; } /* // hailstone_Sequence(int n) // Prints the entire sequence beginning with 'n'. */ void hailstone_Sequence(int n) { // Base case. if (n == 1) { cout << 1; } // Continues to call on itself, while printing // each integer in the sequence until the // base case is reached. else if (n > 1) { cout << n << " "; hailstone_Sequence(next(n)); } } /* // sequence_Length(int n) // Returns the output length of // the hailstone sequence. */ int sequence_Length(int n) { int count = next(n); // Special case statement. if (n == 1) { return 1; } // Determines the length of the sequence until // 'n' is equal to 1 (base case). else { return 1 + sequence_Length(count); } } /* //sequence_Max(int n) //Returns the largest value in the //hailstone sequence starting at 'n'. */ int sequence_Max(int n) { // Base case. if (n <= 1) { return 1; } // Compares two values until the base case is reached. return max (n, sequence_Max(next(n))); } /* // sequence_Comparison(int n) // Returns the length with the longest hailstone // sequence starting from 1 to 'n'. */ int sequence_Comparison(int n) { // Variable Declaration. int originalLength, comparisonLength; // Base case. if(n < 1) { return 1; } // Contains the length of n - 1. comparisonLength = sequence_Comparison(n-1); // Contains the original length of n. originalLength = sequence_Length(n); // Returns the longest length. if(comparisonLength > originalLength) { return comparisonLength; } else { return originalLength; } } /* // largestSeqStart_Num(int n) // Returns the starting value // of the longest sequence that starts on a value from // 1 to 'n'. */ int largestSeqStart_Num(int n) { // Variable Declaration. int lengthn, maxLength, maxLengthStartValue; // Base case. if(n <= 1) { return 1; } // Contains the starting value of the longest sequence with a starting value up to n - 1. maxLengthStartValue = largestSeqStart_Num(n-1); // Contains length of the longest sequence with a starting value up to n - 1. maxLength = sequence_Length(maxLengthStartValue); // Contains the length of the sequence starting with n. lengthn = sequence_Length(n); // Returns the starting value of the longest sequence. if(maxLength > lengthn) { return maxLengthStartValue; } else { return n; } }

Assignment 2 (Recursion)