Need help with example 5 please. And written in c++. 11:29al 55%M8- Arrays 2 - Read-onlyRead Only - You can't save changes to ...Example 4• Rewrite example 3 with afunction fMaxArraythat takes an int array and1 / Ma Example 4// Maximum of an array using function3 tinelude ciestraan4 Ninclude string24 NancludeS ustng namespace std;int fMlasarray(int al), int lungth),8 int maint)9.(int al10)-(32, 21, 4), 21, 30, 11, 15, 34, 38, 14);coutce" The maxdmun element in array is: "cclaxteray(a, 10);its length as parameters10and returns the maximum12 )13 //Note the code is sinilar to exanple 3of the arrayint fMaxarray(int all, int longth){int max:max-a[e); //astume the ftrst eloment is martmamfor(int i-l; iclength; i) //start frue the second element1516//maximum nunber te find//atsume the firet olement ie maxtmum17-18-19//1s elenent greater than max//if yes, then assign ali] te muxnaxali),202122raturn nax23NotesCommentsEumplo 4Emple 5Sarting an anaykRerteangkelae f Thea (Ha ayte a rde ipaReteangta MamayCompak s dd theminfte4 e diSe weieLednee te l eThe9.1011 11:303 all 55%iM8- Arrays 2 - Read-onlyRead Only - You can't save changes to ...Example 5• Rewrite example 4 to calculate the minimum of an array. Thatis, modify fMaxArray to write a function fMinArray thatreturns the minimum of the input array.NotesCommentsEumple 4Emple 5Sarting an anayRenteaneetn MaayRerteangkelae f Themadty (Maayteraften rye an ipaCopfteSe e e9.1011

Given: Need help with example 5, please. And written in c++.

Answered: Example 5 Rewrite example 4 to…

Example 5 Rewrite example 4 to calculate the minimum of an array. That is, modify fMaxArray to write a function f MinArray that returns the minimum of the input array.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

**11.18** Java Solve (ArrayList of Character) Using the following header, create a method that produces an array list of characters from a string: toCharacterArray public static ArrayListCharacter> (String s) ToCharacterArray("abc"), for example, returns an array list containing the characters 'a', 'b', and 'c'.
I want this code in C++ #include <stdio.h> #include<malloc.h>//function to fillint Equalcols(int *A,int rows,int cols){ //creating a dynamic array of length cols to store sum of each column int *b=(int*)(malloc(sizeof(int)*cols)); int i,j; //initializing the values zero in b array for(i=0;i<cols;i++) { *(b+i)=0; } //loop to add elements of each column to respective index in b array for(i=0;i<rows;i++) { for(j=0;j<cols;j++) { //adding value of element in respective column to index in b array *(b+j)+=*(A+j+cols*i); //printf("%d %d\n",j+cols*i,*(A+j+cols*i)); } } //loop to check whether sum is equal or not for(i=1;i<cols;i++) { //printf("%d %d\n",*(b+i-1),*(b+i)); //checking for consecutive value are not equal if(*(b+i-1)!=*(b+i)) { //returning 0 return 0; } } //returning 1 return 1;} int…
NEED IN C!!! 9. Write function getMoveRow to do the following a. Return type integer b. Parameter list i. 1-d character array (i.e. move), size 3 c. Convert the row portion of the player’s move to the associated integer index for the board array d. Example: i. move = ‘b2’ ii. 2 is the row iii. 2 is index 1 in the board array e. Return the row array index that corresponds to the player’s move f. Return a -1 if the row is not valid (i.e. INVALID)
4. b. If A is an array of integers with width = 4; Please translate withthree-address statement, the following expression: x = a[i] + 2;
6.17 LAB: Swapping variables Define a method named swapValues that takes an array of four integers as a parameter, swaps array elements at indices 0 and 1, and swaps array elements at indices 2 and 3. Then write a main program that reads four integers from input and stores the integers in an array in positions 0 to 3. The main program should call function swapValues() to swap array's values and print the swapped values on a single line separated with spaces.
44.____Write a code in CPP that performs the sum operation on array of 10 elements. Elements of array should be taken from user at run time. In order to point to the next position of array you need to use pointer arithmetic.?
11.17 (Bucket Sort) Use Python. Show the whole code input and output when done. A bucket sort begins with a one-dimensional array of positive integers to be sorted and a two-dimensional array of integers with rows indexed from 0 to 9 and columns indexed from 0 to n – 1, where n is the number of values to be sorted. Each row of the two-dimensional array is referred to as a bucket. Write a class named BucketSort containing a function called sort that operates as follows: a) Place each value of the one-dimensional array into a row of the bucket array, based on the value’s “ones” (rightmost) digit. For example, 97 is placed in row 7, 3 is placed in row 3, and 100 is placed in row 0. This procedure is called a distribution pass. b) Loop through the bucket array row by row, and copy the values back to the original array. This procedure is called a gathering pass. The new order of the preceding values in the one-dimensional array is 100, 3 and 97. c) Repeat this process for each subsequent…
Q1. Write a program to sort the elements of 1D array in descending order and also implement linear search on the same array. Both sorting and searching operations should be done inside one user defined function: “Task”. So, for achieving the required functionality, pass, array into the function: Task () from main () using Pass by reference/ or address approach.
3. Consider an 1-d array of type int and a pointer pointing variable pointing to the 2nd item of the array. Write down the code for the following: int arr(10) = (5,6,23,4,89,70,12,78,33); int *ptr = arr+1; (a) Print the first item of the array using ptr. (b) Print all prime numbers of the array using value at address. (c) Print the last item of the array using a pointer to an array. You are not allowed to initialize the pointer to the address of the last item. Iterate using a loop to change the value of the pointer. (d) Now print the array in reverse order using a pointer. 101
4. Insertion Sort• The idea with an insertion sort is that a sorted region grows one item at atime, by inserting an item into its correct position within the sorted region.• As done in Part 1, fill an array with random numbers.• Write a function that inserts an item into a sorted region of an array. Passthe function the index of the item to be inserted (i.e. the index of the firstitem in the unsorted region). Insert that item by shifting items over oneposition, until you have found the correct location to insert the item.• E.g. if given a = [2 5 8 9 6 3 7] and the index 4, a[4] should be inserted into thesorted portion, giving [2 5 6 8 9 3 7]• Write a second function that calls the first function repeatedly, until theentire array is sorted. (Each time the first function is called, it will insert anitem into a larger sorted region.)
C++ 13.10 Write a function SwapArrayEnds() that swaps the first and last elements of the function's array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. #include <iostream>using namespace std; /* Your solution goes here */ int main() { const int SORT_ARR_SIZE = 4; int sortArray[SORT_ARR_SIZE]; int i; int userNum; for (i = 0; i < SORT_ARR_SIZE; ++i) { cin >> userNum; sortArray[i] = userNum; } SwapArrayEnds(sortArray, SORT_ARR_SIZE); for (i = 0; i < SORT_ARR_SIZE; ++i) { cout << sortArray[i] << " "; } cout << endl; return 0;}
2, Using c++, write a function called minIndex that accepts a 1D array of integers "a" and an integer aSize (indicating the size of "a") and returns the index of the minimum value in "a". Additionally, write a second function minValue which accepts a 1D array of intgers and an integer sSize (indicating the size of "a") and returns the minimum value in "a". (Note: the second function can be only one line long if you use minIndex inside it)