Question

Rewrite the following C++ code fragments. Your modified code should obey the following rules: • No global variables • No pass-by-reference and pass-by-pointer parameters (except arrays) • No iteration 1 Fibonacci int fib (int n) { if (n <= 1) return 1; int x = 1; int y = 1; int t; for (int i = 2; i <n; i++) { t = x; x = x + y; y = t; return x; 2 Min and max in an array void minmaxFromArray (long _array[l, short _array_length, long & _min, long & _max) { short i; long min = _array [0]; long max = array [1]; for (i=1; i<_array_length; i++) { if (array[i] < min) min = _array[i]; if (array[i] > max) max = _array[i]; _min = min; _max = max; 3 Inserting an entry to a dictionary vector<pair<string, string> > dictionary; void setDictionaryEntry (string _key, string _value) { unsigned short i; for (i=0; i<dictionary.size(); i++) { if (dictionary[i].first == _key) { dictionary[i].second = _value; return; dictionary.push_back (pair<string, string> (_key, _value));

Answer 1

1)

#include <iostream>
using namespace std;

// Recursive function to return fibonacci series
int fibonacci(int number)
{
// Checks if the parameter number is less than or equals to 1
// return the number
if (number <= 1)
return number;

else
// Otherwise recursively call the function with parameter number minus one
// added with parameter number minus two
return fibonacci(number - 1) + fibonacci(number - 2);
}// End of function

// main function definition
int main ()
{
// To store the number entered by the user
int number, no = 0;
// Accepts the number
cout<<"\n Enter number of terms: ";
cin>>number;

for (int c = 1; c <= number; c++)
// Calls the function to generate fibonacci number
// Returns the returned value
cout<<fibonacci(no++)<<" ";
return 0;
}// End of main function

Sample Output:

Enter number of terms: 7
0 1 1 2 3 5 8

2)

#include <iostream>
using namespace std;

// Recursive function to display maximum and minimum element from array
void minmaxFromArray(long _array[], short arrayLength, int index, long _min, long _max)
{
// Checks if parameter index is less than array length
if(index < arrayLength)
{
// Checks if parameter maximum number is less then the array current index position value
if(_max < _array[index])
// Assign array current index position value to parameter variable max
_max = _array[index];

// Checks if parameter maximum number is greater then the array current index position value
if(_min > _array[index])
// Assign array current index position value to parameter variable min
_min = _array[index];

// Recursively calls the function with current index plus one
// and updated max and min
minmaxFromArray(_array, arrayLength, index + 1, _min, _max);
}// End of if condition

// Otherwise end of the array
else
{
// Displays maximum and minimum
cout<<"\n Maximum = "<<_max<<" ";
cout<<"\n Minimum = "<<_min<<" ";
}// End of else
}// End of function

// main function definition
int main()
{
// Creates an array
long _array[] = {11, 49, 41, 62, -20, 90, 23};
// Calculates length
int len = sizeof(_array)/sizeof(_array[0]);
// Calls the function to display maximum and minimum from array
minmaxFromArray(_array, len, 0, _array[0], _array[0]);
return 0;
}// End of main function

Sample Output:

Maximum = 90
Minimum = -20