Write a program which should consists of a user defined function “Task ()” [Function returns no value]. Pass 1D array to the function, along with number of elements of array and element to search. Function should implement linear search, and if the element is not found in the array, then insert that element at the end of array .Display the final array after insertion [After function is called] in the main () function. [Note: Array should be passed using by reference approach]

Write a program which should consists of a user defined function “Task ()” [Function returns no value]. Pass 1D array to the function, along with number of elements of array and element to search. Function should implement linear search, and if the element is not found in the array, then insert that element at the end of array .Display the final array after insertion [After function is called] in the main () function. [Note: Array should be passed using by reference approach]

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a program which shouldconsists of a user definedfunction “Newfunction ()”. Pass1D array to the function, alongwith number of elements ofarray and element to search.The Function should implementlinear search. [Note: Arrayshould be passed using by valueapproach]
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;…
Implement the buildDistributionArray function to take an array of scores, built by parseScores, as an argument. A grade distribution array of length 5 is returned. Loop through the scores array and tally up the number of A, B, C, D, and F scores using the standard scoring system (90 and above = A, 80‐89 = B, 70‐79 = C, etc.). Store these totals in a distribution array where the number of As is the first number, number of Bs is the second number, etc. Ex: ["45","78","98","83","86","99","59"] → [2, 2, 1, 0, 2] buildDistributionArray returns [0, 0, 0, 0, 0] when the scoresArray argument is empty.
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 QuickSort of ints that sorts the numbers in the non-decreasing order. Implement the rearrange function using QuickSort ( such that the pivot is set on the extreme left and the rearrangement is carried on on two pointers) using the O(n) time algorithmThe function gets as input an array, and index of the pivot.The function rearranges the array, and returns the index of the pivot after the rearrangement. int rearrange(int* A, int n, int pivot_index); Implement the QuickSort algorithm. - For n<=2 the algorithm just sorts the (small) array (smaller number first). - For n>=3 the algorithm uses the rearrange function with the pivot chosen to be the median of A[0], A[n/2], A[n-1]. void quick_sort(int* A, int n);
Write a C program that will ask the user to input (from the console) number of students in a class andtheir respective marks for programming in C course. Your task is to store their marks in an Array, printthat array and find the maximum an minimum marks in the class. Please use Dynamic memoryallocation for this task. Check the image attached below for sample output:
Write a program that creates an array of size 6 and input values to it through user input. It turnsout that these values that the user inputs were biased, and had an offset relative to the index ofthe array (for example, the first value had no bias since index = 0, the second value had a bias of 1since index = 1, and so on...).Pass this array to a function, that should remove the bias from each value by subtracting the biasfrom the original value. You need to subtract values using a for loop.Print the updated values of the array in the main function after the call to this bias removerfunction.
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…
(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, 42
Write a function / program that does the following: int moveToEnd(string a[], int n, int pos); Eliminate the item at position pos by copying all elements after it one place to the left. Put the item that was thus eliminated into the last position of the array. Return the original position of the item that was moved to the end. Here's an example: string people[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; int j = moveToEnd(people, 5, 1); // returns 1 // people now contains: "samwell" "margaery" "daenerys" "tyrion" "jon" Notwithstanding each function's behavior described above, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array.
Write a program to sort the elements of 1 D array in descending order and also implement linear search on the same array. Both sorting and searching should be done inside one user defined function: Task. So for achieving the required functionality, pass array into function: Task () from main () using pass by reference/ or address approach
Write a program that reads an integer array a[] from the console and writes out the subsequence of the array that sums to the largest value. If there are more than one such subsequence, then the program should write out the subsequence that starts at the smallest position in the array and, if there are more than one subsequence of largest sum starting at the same smallest position, it should write out the shortest such subsequence.