Create a function that takes two "sorted" arrays of numbers and returns an array of numbers which are common to both the input arrays. Examples common Elements([-1, 3, 4, 6, 7, 9], [1, 3]) → [3] common Elements([1, 3, 4, 6, 7, 9], [1, 2, 3, 4, 7, 10]) → [1, 3, 4, 7] common Elements([1, 2, 2, 2, 3, 4, 5], [1, 2, 4, 5]) → [1, 2, 4, 5] common Elements([1, 2, 3, 4, 5], [10, 12, 13, 15]) → []

Create a function that takes two "sorted" arrays of numbers and returns an array of numbers which are common to both the input arrays. Examples common Elements([-1, 3, 4, 6, 7, 9], [1, 3]) → [3] common Elements([1, 3, 4, 6, 7, 9], [1, 2, 3, 4, 7, 10]) → [1, 3, 4, 7] common Elements([1, 2, 2, 2, 3, 4, 5], [1, 2, 4, 5]) → [1, 2, 4, 5] common Elements([1, 2, 3, 4, 5], [10, 12, 13, 15]) → []

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Write 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) )
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
Write a function is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
2. Implement a function called findMinGap that will return the smallest gap betweenadjacent entries of an integer array. A gap between two numbers is the absolutevalue of their difference. For example, if an array contains the elements {10, 14,-5, -3, 0, 5, 7}, the minimum gap is 2 (between -5 and -3).Title line: int findMinGap(int array[], int length)
Write c++ function that takes 2 arguments, an array of integers, and the number of elements in the array that make value separating the higher half of the data from the lower half (Upward ranking) ex : before arr[]={4,7,2,4,0,9} after arr[]={0,2,4,4,7,9}
Write a function that receives a two-dimensional array, prints out the data by row along with the sum of the row values. Each value should be printed separated by a space. After the last element in the row has been printed, the sum should be printed on the same line, followed by a newline.
Write 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…
2. Write a program which sorts the CGPA array having cgpa of all students in ascending order by using bubble sort and make use of pointers for each and every variable and constant and array.
Write a function for given main functionint * return_an_array(int n)which takes an integer n and returns a pointer to an array (allocated off of the heap inthe function) containing the digits of n in the appropriate positions. If n = 0 return 0(which is the “null” pointer). Recall an array name is just a pointer to the first element ofthe array. Please use following main to test your function.int main() {int *a = return_an_array(23542); // array of size 5for(int i=0;i<5;i++)cout<<a[i]<<" "; // print 2 3 5 4 2cout<<endl;delete [] a;int *b = return_an_array(12345678); // array of size 8for(int i=0;i<8;i++)cout<<b[i]<<" "; // print 1 2 3 4 5 6 7 8cout<<endl;delete [] b;return 0;}
Create two Arrays A with 10 unsorted integer elements and B with 10 unsorted floatelements. Find the largest element in A and B and then sum both of them calling afunction SumAB() by reference. Sort A and B and then call another function StichAB()to merge B with A. Be careful about memory leakage.
1) Write a function named maxDiff which returns the maximum difference between any two values in a 3x3 2D array.This function should accept a 3x3 2D array, and the size of each dimension as parameters.ExampleCalling maxDiff with this 2D array:33 71 2092 38 6382 54 32Returns a maximum difference of 72 (92 - 20).in c++
Write a function called largest_sum_sequence() that accepts an array of signed integers and the number of items in the array as parameters, and returns the largest sum of a sequence of numbers in the array. A sequence is defined as a single item or multiple items that are in consecutive adjacent memory locations. Example 1: 9 3 -1 7 -12 largest sum in sequence is 18 [9, 3, -1, 7] Example 2: -77 3 -2 1 largest sum in sequence is 3 [3]