Starting Out With C++: Early Objects (10th Edition)
10th Edition
ISBN: 9780135235003
Author: Tony Gaddis, Judy Walters, Godfrey Muganda
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 16.2, Problem 16.7CP
The function
int minPosition(int arr[ ], int size)
takes an array of integers of the given size and returns the index of the smallest element of the array. Define a template that works like this function but permits as parameter arrays of any type that can lie compared using the less-than operator <.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Implement a function GetMinimumCutSegments(int[] arr, int k) that takes in an array arr of positive integers and an integer k, and returns the minimum number of contiguous segments of the array that must be concatenated to form an array of size k.
The function should return -1 if it is not possible to create an array of size k by concatenating contiguous segments of the input array.
Example:
Input: [1, 2, 3, 4], 6
Output: 2
Explanation:
The minimum number of contiguous segments that must be concatenated to form an array of size 6 is 2. The two segments that can be concatenated are [1, 2] and [3, 4].
Input: [1, 2, 3, 4], 7
Output: -1
Explanation:
It is not possible to create an array of size 7 by concatenating contiguous segments of the input array.
Constraints:
The input array arr will have at most length 100.
The integer k will be at least 1 and at most 10^6.
Can you write a C# function that solves this problem?
public int GetMinimumCutSegments(int[] arr, int k) { // Your code…
Implement a range function for a dynamic array which returns a new dynamic array that is a subset of the original.
input parameters: array - (the array and any related parameters) start - index of the first elementend - index of the last elementInterval - An integer number specifying the incrementation of index
This function returns a new dynamic array containing the elements from the start thru the end indices of the original array.All array indexing must be done using pointer arithmetic.
For example, given the array: 49 96 99 47 76 29 22 16 30 22
If the start and end positions were 5 and 9 with step 2, return a new dynamic array: 29 16 22
Please use following main to test your function.
int main(){int *p = new int[10]{49,96,99,47,76,29,22,16,30,22}; int *q = range(p,10,5,9,2);for(int i=0;i<3;i++)
cout<<q[i]<<" "; // print 29 16 22 cout<<endl;delete [] q;q = range(p,10,1,8,3);
for(int i=0;i<3;i++)cout<<q[i]<<" "; // print 96 76 16
cout<<endl;…
An array with any number of elements is said to be repeating if any two or more of the elements are appearing in sequential an indexes after each other.Write a C++ function that accepts an integer array and returns 1 or “Repeating” if it is a repeating array, otherwise it returns 0 or “Not Repeating”. For Instance:2, 3, 5, 6, 7, 7, 7, 6, 8, 10 - Repeating2, 3, 4, 6, 4, 6, 4, 7, 8, 9 - Not repeating
Chapter 16 Solutions
Starting Out With C++: Early Objects (10th Edition)
Ch. 16.1 - Prob. 16.1CPCh. 16.1 - Prob. 16.2CPCh. 16.1 - Prob. 16.3CPCh. 16.1 - Prob. 16.4CPCh. 16.1 - Prob. 16.5CPCh. 16.2 - Prob. 16.6CPCh. 16.2 - The function int minPosition(int arr[ ], int size)...Ch. 16.2 - What must you be sure of when passing a class...Ch. 16.2 - Prob. 16.9CPCh. 16.4 - Prob. 16.10CP
Ch. 16.4 - In the following Rectangle class declaration, the...Ch. 16 - The line containing a throw statement is known as...Ch. 16 - Prob. 2RQECh. 16 - Prob. 3RQECh. 16 - Prob. 4RQECh. 16 - The beginning of a template is marked by a(n)...Ch. 16 - Prob. 6RQECh. 16 - A(n)______ container organizes data in a...Ch. 16 - Prob. 8RQECh. 16 - Prob. 9RQECh. 16 - Prob. 10RQECh. 16 - Write a function template that takes a generic...Ch. 16 - Write a function template that is capable of...Ch. 16 - Describe what will happen if you call the function...Ch. 16 - Prob. 14RQECh. 16 - Each of the following declarations or code...Ch. 16 - Prob. 16RQECh. 16 - String Bound Exceptions Write a class BCheckString...Ch. 16 - Prob. 2PCCh. 16 - Prob. 3PCCh. 16 - Sequence Accumulation Write n function T...Ch. 16 - Rotate Left The two sets of output below show the...Ch. 16 - Template Reversal Write a template function that...Ch. 16 - SimpleVector Modification Modify the SimpleVector...Ch. 16 - Prob. 8PCCh. 16 - Sortabl eVector Class Template Write a class...Ch. 16 - Prob. 10PCCh. 16 - Word Transformers Modification Modify Program...Ch. 16 - Prob. 12PC
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
What is a source program? What is an object program?
Problem Solving with C++ (9th Edition)
Consider the adage Never ask a question for which you do not want the answer. a. Is following that adage ethica...
Experiencing MIS
Write code for a function with the following prototype: / Divide by power of 2. Assume 0 = k w-1 / int divide_...
Computer Systems: A Programmer's Perspective (3rd Edition)
Given that y=ax3+7, which of the following are correct Java statements for this equations? int y = a x (x x +...
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
What is the purpose of testing a program with sample data or input?
Starting Out With Visual Basic (8th Edition)
Is the following program legal? If so, what is the output? #include iostream #include vector using namespace st...
Problem Solving with C++ (10th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- You are given the array-like data structure Listy, which does not have a size.method. It does, however, provide an elementAt I function that returns the element at index I in the array of elements. 0( 1) time. If I exceeds the data structure's boundaries, it returns -1. (As a result, the data structure only works with positive numbers.) Given a Listy of sorted positive integer ,Determine the index at which an element x appears. If x happens more than once, you may return any index.arrow_forwardWrite a function template that takes a single type parameter (T) and accepts four function arguments: an array of T, a start index, a stop index (inclusive), and an optional initial value. The function returns the sum of all the array elements in the specified range and the initial value. Use the default constructor of T for the default initial value.arrow_forward***PLEASE ANSWER QUESTION 2. THE FOR CONSTRUCT IS COMPLETED ABOVE IT. I NEED IT DONE WITH PROPER SCOPE, NO DEEP COPIES. THANK YOU*** function for_(cur, cond, next, fbody) { if (cond(cur)) { fbody(cur); for_(next(cur), cond, next, fbody); } } exports.for_ = for_; /* QUESTION 2 (5pts): * * Using the above for_ construct, you will now implement a construct for * iterating over elements of an array. each takes a list and a function f. For * each element in the list, the function calls f with the element and the * index of the element in the list. */ function each(list, f) { if (list.size == 0) { return; } //FILL IN ********* } exports.each = each; ***PLEASE ANSWER QUESTION 2. THE FOR CONSTRUCT IS COMPLETED ABOVE IT. I NEED IT DONE WITH PROPER SCOPE, NO DEEP COPIES. THANK YOU***arrow_forward
- Write a program to overload the function call operator ( ) so as to allow the more common form of double-array subscripting. Therefore, instead of saying: chessBoard[row][column] for an array of objects, overload the function call operator to allow the alternate form: chessBoard(row, column) A sample output of your program should look like follows: The value of each array element is the product of the row and column values. Using the class definition given in the myClassOperator.h header file below, implement the class member functions and driver code in separate files.arrow_forwardImplement a CircularArray class that supports an array-like data structure whichcan be efficiently rotated. If possible, the class should use a generic type (also called a template), and should support iteration via the standard for (Obj o : circularArray) notation.arrow_forwardwrite a recurrence(not Java or pseudocode) defining the function that takes an arrayof natural numbers as a parameter and that returns the largest element of an arrayarrow_forward
- Implement a CircularArray class that supports an array-like data structure whichcan be efficiently rotated. If possible, the class should use a generic type (also called a template), andshould support iteration via the standard for (Obj o : circularArray) notation.arrow_forwardWrite a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…arrow_forward(This if for mindtap on cengage, if not possible, use devc++ 5.11 but mindtap is more accurate) Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: (look at picture) You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42arrow_forward
- Rewrite the Binary search function in the textbook to use a generic type for the array elements. Test the function with arrays of int, double, and string values. *When using test arrays make sure elements are stored in ascending sorted order*arrow_forwardImplement substringList() that will produce the collection of words from the 1D array B that has substrings equivalent to the string key. The resulting collection should be stored in array C and this should contain only the unique set of words. The function returns the resulting total number of elements in array C. For your reference, a substring is a contiguous sequence of characters within a string. As an example, the strings “app”, “ppl”, “apple”, and “e” are among the substrings from the string “apple”. But, strings “ale” are “elppa” are not substrings from string “apple”. key = "or" array B = {"it's", "today", "now", "or", "forever", "today", "ACT"} array C should be {"or", "forever"} Rules: You can only use strcmp, strcat, and strcpy Maximize the use of loops (e.g., for) you can create local variables that can aid youarrow_forwardWrite a function that takes two int arrays arr1 and arr2, and their size n as parameters. The functionreturns the number of elements that exist in arr1 and arr2 with indexes i1 and i2 respectively such that i1>=i2.(Example: arr1: [ 1,5,2,3,4,0,7] arr2: [0,1,3,7,4,2] then the function returns 3 ( 0,3,7) )arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License