Question

Suppose we have a struct type IntPair with members int smaller and int bigger. Implement the function

IntPair getSmallestAndBiggest(int nums[], int length);

that returns an IntPair with the smallest value of nums in member smaller and the biggest value of nums in the member bigger. Note: If length is 1 and more generally if all the elements of nums have the same value then smaller and bigger will be equal. (You may assume that length ≥ 1.)

Answer 1

#include <iostream>

using namespace std;
struct IntPair
{
int smaller;
int bigger;
};

IntPair getSmallestAndBiggest(int nums[], int length);
int main()
{
int nums[] = {5,6,1,2,3,9,8};
IntPair intPair = getSmallestAndBiggest(nums, 7);
cout<<"Smaller: "<<intPair.smaller<<endl;
cout<<"Bigger: "<<intPair.bigger<<endl;
return 0;
}
IntPair getSmallestAndBiggest(int nums[], int length) {
IntPair intPair;
intPair.smaller = nums[0];
intPair.bigger = nums[0];
for(int i=1;i<length;i++) {
if(intPair.smaller>nums[i]) {
intPair.smaller = nums[i];
}
if(intPair.bigger<nums[i]) {
intPair.bigger = nums[i];
}
}
return intPair;
}

Output:

Smaller: 1                                                                                                                                    

Bigger: 9