Cpp Chapter 8: Adventures in Functions Exercise

Exercise 3:

// Exercise 3 for chapter 8: by TBNR_Gabriel
#include <iostream>
#include <cstring>
#include <string>
using namespace std;

void convert(string & str);

int main()
{
    string str;
    cout << "Enter a string (q to quit): ";
    getline(cin,str);
    while (str != "q")
    {
        convert(str);
        cout << str << endl;
        cout << "Enter a string (q to quit): ";
        getline(cin,str);
    }
    cout << "Done.
";
    return 0;
}

void convert(string & str)
{
    for (int i = 0; i < str.size(); i++)
        str[i] = toupper(str[i]);
}

Exercise 5:

// exercise 5 for chapter 8: by TBNR_Gabriel
#include <iostream>
using namespace std;

template <typename T>
T large(T * arr);

int main()
{
    int n1[5] = {2,5,3,4,1};
    double n2[5] = {2.1,3.3,4.4,1.3,4.2};
    int l1 = large(n1);
    double l2 = large(n2);
    cout << l1 << " " << l2 << endl;
    return 0;
}

template <typename T>
T large(T * arr)
{
    T maxi = arr[0];
    for (int i = 0; i < 5; i++)
    {
        if (arr[i] > maxi)
            maxi = arr[i];
    }
    return maxi;
}

Exercise 6:

// Exercise 6 for chapter 8: by TBNR_Gabriel
#include <iostream>
#include <cstring>
using namespace std;

template <typename T>
T large(T * arr, int n);

template <> char * large(char ** arr, int n);
int main()
{
    int n1[6] = {1,3,5,6,4,2};
    double n2[5] = {1.1,3.5,4.2,1.3,4.1};
    int l1 = large(n1, 6);
    double l2 = large(n2, 5);
    cout << l1 << " " << l2 << endl;
    char a[30] = "aa";
    char b[30] = "bbb";
    char c[30] = "ccccc";
    char d[30] = "d";
    char e[30] = "ee";
    char * arr[5] = {a,b,c,d,e};
    char * ps = large(arr, 5);
    cout << ps << endl;
    return 0;
}

template <typename T>
T large(T * arr, int n)
{
    T maxi = arr[0];
    for (int i = 0; i < n; i++)
    {
        if (arr[i] > maxi)
            maxi = arr[i];
    }
    return maxi;
}

template <> char * large(char ** arr, int n)
{
    int length[n];
    for (int i = 0; i < n; i++)
        length[i] = strlen(arr[i]);
    int maxi = -1;
    int index = 0;
    for (int i = 0; i < n; i++)
    {
        if (length[i] > maxi)
        {
            maxi = length[i];
            index = i;
        }
    }
    return arr[index];
}