Question

c++, we have to write functions for the code given below and other instructions for it to compile. I am having issues understanding how to confront the problem and how to write functions and read the program so it can eventually be solved so it can be compiled

7/ * INSTRUCTIONS: Write two functions in the space // * indicated below. // * // * #1 => Find index of maximum value: Write a function that will // * find the INDEX of the FIRST INSTANCE of the maximum value // * in the array. There may be more than one copy of the maximum // * value so just pass back the first index found. // * // * #2 => Insert a given number before the first maximum: Find the // * first instance of the maximum and insert a passed in number // * BEFORE this element. Do not delete any elements in the array, // * or change the order of any elements in the array. // * II * NOTE: The first function can be used with the second function. // * //* // * keep in mind that I will ONLY BE // * USING YOUR FUNCTIONS by copying it to another // * main.cpp file (with different variable values), /* for grading. So don't code to the given data, * values or expect your code outside your functions * to copy over. * Do not use global variables/constants * or goto's in your code. * Don't ask the user for information. The main * function will get all information needed and pass it * into your functions (see main function for * how your functions will be called). * three example runs are below: FIRST EXAMPLE BEFORE 1 6 2 -16 -16 2 -5 200 Index of maximum: 7 Number to Insert: 888 AFTER

Answer 1

We can solve the given problem in C++ using following concepts/procedures

1. The concept of call by reference. Call by reference is a way of passing the address of a variable to a function and therefore the original value gets modified, if changes are made inside that function. In the given problem we have to pass the address of our array and count variable, so that changes made inside insertNumber() function is reflected in the main() function
2. For inserting the new element, we have to move the remaining elements by 1 step. For this, we start from the end of the array upto the index where we need to insert the new element and keep shifting elements by 1 position to the right.

Given below is the entire C++ file with the required functions and main():

Solution:

using namespace std;
#include <iostream>

int findMaxIndex(int array[], int count) {
  
// assume the maximum element is at index 0
int maxIndex = 0;
  
// loop from index 1 upto count-1
for(int i=1; i<count; i++) {
  
// check if any element is greater than element at index "maxIndex"
if(array[i] > array[maxIndex]) {
  
// if yes, over write maxIndex value with that element's index
maxIndex = i;
}
}
  
return maxIndex;
}

// we use * and & in the function parameter which indicates we pass arguments to this function by reference
// * is used when we need to pass array by reference
// & is used when we need to pass int by reference
void insertNumber(int *array, int& count, int number) {
  
// find the max element's index using the findMaxIndex() function
int maxIndex = findMaxIndex(array, count);
int i;
  
// loop from end of array upto the maximum element's index
for(i=count-1; i>= maxIndex; i--) {
// shift each element by 1 position to right
array[i+1] = array[i];
}
  
// insert the new element in correct index
array[++i] = number;
  
// update the count of the elements in given array
count++;
}

void printArray(int array[], int count) {
cout << endl << "---------------------" << endl;
for(int i=1; i <=count; i++) {
if(i%3 == 0)
cout << " " << array[i-1] << endl;
else
cout << " " << array[i-1];
}
  
cout << endl << "---------------------" << endl;
}

int main()
{
int index, number;
  
int array[200] = {1, 140, 32, 3, 140, 21, 3};
int count = 7;
  
cout << "BEFORE";
printArray(array, count);
  
index = findMaxIndex(array, count);
cout << "Index of maximum: " << index << endl;
cout << "Number to insert: ";
cin >> number;
  
insertNumber(array, count, number);
  
cout << "AFTER";
printArray(array, count);
return 0;
}

Given below is the screenshot of the complete code and sample output

******************************

CODE

******************************

using namespace std; #include <iostream> 5. int findMaxIndex(int array[], int count) { // assume the maximum element is at index 0 int maxIndex = 0; // loop from index 1 upto count-1 for(int i=1; i<count; i++) { 11, // check if any element is greater than element at index "maxIndex" if(array[i] > array[maxIndex]) { // if yes, over write maxIndex value with that element's index maxIndex = i; return maxIndex; ph

24 / we use * and & in the function parameter which indicates we pass arguments to this function by reference 25 // * is used when we need to pass array by reference 26 // & is used when we need to pass int by reference 27. void insertNumber(int *array, int& count, int number) { function // find the max element's index using the findMaxIndex int maxIndex = findMaxIndex(array, count); int i; // loop from end of array upto the maximum element's index for(i=count-1; i>= maxIndex; i--) { // shift each element by 1 position to right array[i+1] = array[i]; // insert the new element in correct index array[++i] = number; 47 // update the count of the elements in given array count++; 44 } 45 46 void printArray(int array(), int count) { cout << endl << "--- -----" << endl; for(int i=1; i <=count; i++) { if(i%3 == 0) cout << " " «< array[i-1] << endl; else cout << " " « array[i-1]; cout << endl << "------ ---------" << endl; 56 } 57

58 int main() 59-{ int index, number; int array[200] = {1, 140, 32, 3, 140, 21, 3}; int count = 7; cout << "BEFORE"; printArray(array, count); index = findMaxIndex(array, count); cout << "Index of maximum: " << index << endl; cout << "Number to insert: "; cin >> number; insertNumber(array, count, number); cout << "AFTER": printArray(array, count); return 0;

******************************

OUTPUT

******************************

BEFORE 1 140 32 3 140 21 - - - - - - - - - - - - - - - - - - - - - Index of maximum: 1 Number to insert: 333 AFTER 1 333 140 32 3 140 21 3 ... Program finished with exit code 0 Press ENTER to exit console.