(Q3) This is a Data Structures problem and the programming language used is Lisp. Solve the question we detailed steps and make it concise and easy to understand. Please and thank you. Question 3:For function f below:a.Provide the running time T(n).Provide the order of growth (Big-O).b.6Assume a is an array, and assume each of the operators/functions ‘print’, ‘aref’,‘:=', '*', and '/' take 1 (one) unit of running time. You may ignore the runningtime of the loop tests.(defun f (a)(let ((n (length a)))(dotimes (j n) ; loop stop test(do ((i 1 (* i 2))(x 2))((= i n)) ; loop stop test(:= x (+ x 7)))(print (*x (elt a j))))))

In the provided Lisp code, we are given a function f that accepts an array a as its parameter. The…

For function f below: a. Provide the running time T(n). Provide the order of growth (Big-O). b. Assume a is an array, and assume each of the operators/functions ‘print’, ‘aref', -' '*' and '/' take 1 (one) unit of running time. You may ignore the running

For function f below: a. Provide the running time T(n). Provide the order of growth (Big-O). b. Assume a is an array, and assume each of the operators/functions ‘print’, ‘aref', -' '*' and '/' take 1 (one) unit of running time. You may ignore the running

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Write a function that gets an array as a parameter (address and size) and a number and checks to see if that number exists in the array. The function should report every single occurrence of the number in the array. It should also report how many occurrences were detected in total (use c code)Suggested prototype: void findnReport(int* ar, int size, int num) Example of function output: If array = {2,5,3,5,12,13,14,15,0,5,-1,11,5} and num = 5, Number 5 found in array index 1 Number 5 found in array index 3 Number 5 found in array index 9 Number 5 found in array index 12 Total of 4 occurrences of number 5
Please use C++ and make sure it's for a sorted array Write a function, removeAll, that takes three parameters: an array of integers,the number of elements in the array, and an integer (say, removeItem). Thefunction should find and delete all of the occurrences of removeItem in thearray. If the value does not exist or the array is empty, output an appropriatemessage. (Note that after deleting the element, the number of elements in thearray is reduced.) Assume that the array is sorted.
30.// programming Write a function void reverse(int a[ ], int size) to reverse the elements in array a, the second parameter size is the number of elements in array a. For example, if the initial values in array a is {5, 3, 2, 0}. After the invocation of function reverse(), the final array values should be {0, 2, 3, 5} In main() function, declares and initializes an integer array a with{5, 3, 2, 0}, call reverse() function, display all elements in final array a. Write the program on paper, take a picture, and upload it as an attachment. Or just type in the program in the answer area. m861144 m861144
3) Create a function named "makeThemOdd". The function should accept a parameter named "numberArray". Use the higher order function map() to create a new array that contains all the numbers from the original parameter array but adds 1 to each even number. The new array should only have odd numbers in it. Return the new array. // Use this array to test your function:const testingArray = [1, 2, 4, 17, 19, 20, 21];
Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise. A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks
Is it correct to say that a function that accepts an array as a parameter has access to the original array or that it just has access to a copy of it?
Define a function void dbl(int *, int);that will double all the values in an integer array.Note: consider why there should be a second parameter.
You can prevent a function from changing the actual parameter of an array by: Select one: a. passing the array by value b. using const in the declaration of the formal parameter c. individually declaring all the elements as constants d. using static in the declaration of the formal parameter
In java there must be at least two calls to the function with different arguments and the output must clearly show the task being performed. (ONLY ARRAYS or ARRAYLIST) Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise. A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks. Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8,…
Write a function that will combine two arrays of different lengths into another array. Express the function's running time in terms of actual running time and Big-Oh notation. For reference, this is the function declaration: void combine(int* comb_arr, int* arr1, int n, int* arr2, int m) where comb_arr- the array used to combine arr1 and arr2 arr1 - the first array n - the length of the first array arr2 - the second array m - the length of the second array INITAL CODE TO BE COMPLETED #include <iostream>using namespace std;void combine(int*, int*, int, int*, int); int main(void) { // Hey there, start typing your C++ code here... int size1, size2; cin >> size1; int arr1[size1]; for (int i = 0; i < size1; i++) { cin >> arr1[i]; } cin >> size2; int arr2[size2]; for (int i = 0; i < size2; i++) { cin >> arr2[i]; } int comb_size = ___; int comb_arr[comb_size]; combine(comb_arr, arr1, size1, arr2, size2);…
Please use C++ and make sure it's for a sorted array Write a function, remove, that takes three parameters: an array of integers,the number of elements in the array, and an integer (say, removeItem). Thefunction should find and delete the first occurrence of removeItem in thearray. If the value does not exist or the array is empty, output an appropriatemessage. (Note that after deleting the element, the number of elements inthe array is reduced by 1.) Assume that the array is sorted.
Implement a function that finds the number of values that are less than 0 and the number of values greater than 0 stored in an array of integers. Assume the array is the partially filled array from the previous question, and uses 0 to indicate the end of values stored in it. (18 pts) Note: the results should be passed back to the caller, not directly displayed in the function. Also note, as the following code template requires, the function’s return type is void. Please finish the function header, and function implementation. Hint.. In the beginning, set the lessThan and greaterThan values to be 0. Then as you scan through the array elements one by one, compare the next array element with 0. If the element is greater, update your greaterThan count; otherwise, if the element is less, update the lessThan count, otherwise do nothing. Continue until you see the value 0. GIVEN CODE: #include <iostream>using namespace std; // Find the number of values stored that is less than 0…