------ONLY USE TEMPLATE PROVIDE AT END OF QUESTION YOUR SOLUTION--------- Write a C++ program to input N integer numbers into a single dimension array. Sort them in ascending order using the bubble sort technique. Print both the given array and the sorted array with suitable headings.Strictly adhere to the Object-Oriented specifications given in the problem statement. All class names, member variable names, and function names should be the same as specified in the problem statement.Define the sort method in the Sort class. Input Format:The first input consists of an integer which corresponds to the number of elements present in the single dimension array. The next 'n' inputs are the elements in the array.  Output Format:The first line output consists of array elements before sorting and the next line of the output consists of array elements after sorting.Refer to sample input and output for formatting specifications.[All text in bold corresponds to input and the rest corresponds to…

Fix an error and show it please? And here are the information about the homework and for the error too. def kwargs_to_args_decorator(*args, **kwargs): This question is meant to test your knowledge of creating a decorator that accepts an arbitrary number of positional and keyword arguments, to decorate a function that accepts an arbitrary number of positional and keyword arguments, and alters the arguments before passing them to the decorated function. When the decorated function is invoked, this decorator should modify the arguments the decorated function receives. This decorator should filter out all positional arguments passed to the decorated function, which are found in the positional arguments passed to the decorator when the decorator was initialized. It should also filter out all keyword arguments with keys that are found in the keyword arguments given to the decorator when the decorator was initialized. After performing the modifications to the arguments, the decorator should…

3.use c code to Write a function that gets two same size arrays as parameters and determines if they are permutations of each other. Two arrays are permutations of each other if one can be obtained by shuffling the other. If the arrays are permutations, the function should return 1 otherwise it should return 0. A suggested prototype for that function could be:int isPermutation(int array1[], int array2[], int commonSize)   Example: If the two arrays are: Array1: {1,2,4,0, 5} Array2: {0,5,3,2, 1) Function should return a 0. If the ‘3’ in Array2 is changed to ‘’, it should return 1 Hint: answer must use c code and show the output

I need the answer quickly   What is the meaning of the following declaration? int(*p[5])(); a) p is pointer to functionb) p is array of pointer to functionc) p is pointer to such function which return type is the arrayd) p is pointer to array of function

1-Write a C++ program to input elements in array and sort array elements in  descending order. How to sort array in descending order in using pointers.Use function to print out the original and sorted arrays, Example Input Input size of array: 10  Input array elements: 20, 2, 10, 6, 52, 31, 0, 45, 79, 40  Output Array sorted in descending order:  79 ,52,45,40,31,20,10,6,2,0

#17a Simple Statistics (not in textbook) Generate a STL array or vector of 1000 floating point numbers in the range 0 to 1. Compute the mean, median, and standard deviation of these. You may use function objects and lambda expressions, and the STL algorithms for_each, accumulate, and sort. You may not use any of the built-in looping constructs while, do-while or for. Also you may not create and use any ordinary c++ functions. Hint: The following code can be used to populate your random array named arr auto arr_store = [](float& v) { v = rand()/float(RAND_MAX); }; for_each(arr.begin(),arr.end(),arr_store); Warning, You may need to know some details about lambda expressions that are not covered in the textbook. These will be covered in the weekly lecture and in a sample program in Sakai resources. Note: The theoretical value of the standard deviation for large N is sqrt(1.0/12) which about 0.289. You should be getting a value fairly close to this.

In c++ please with clear indentation thank you so much Write the simplest program that will demonstrate iteration vs recursion using the following guidelines -  Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime.  Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one…

5. Using c++, Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.

Do void and NULL pointers differ? Support your answer with examples. Tabulate the differences.