Using recurrence relations, solve the big-O of the following. Assume ArrayLike has the same big-O as an array and that comparing T objects to each other is O(1). Show work. template int ternary_search(const ArrayLike& array, const T& value, int low, int high) {// Base case:if (high <= low)return -1;// General case:int one_thirdint two_thirds =if (array[one_third] > value) { // if we should recurse on the 1st thirdreturn ternary_search(array, value, low, one_third);} else if (array[one_third]return one_third;} else if (array[two_thirds] > value) { // if we should recurse on 2nd thirdreturn ternary_search(array, value, one_third + 1, two_thirds);} else if (array[two_thirds]return two_thirds;} else { // else we should recurse on the last thirdreturn ternary_search(array, value, two_thirds + 1, high);}}low + (high - low) / 3;= low + 2 * (high - low) / 3;value) { // if value is at the 1st third==value) { // if value is at the 2nd third==

Here we are going to do a ternary search before that first know what is a ternary search? Ternary…

template int ternary_search(const ArrayLike& array, const T& value, int low, int high) { // Base case: if (high return -1; low) // General case: int one_third = low + (high - low) / 3; int two_thirds if (array[one_third] > value) { // if we should recurse on the 1st third = low + 2 * (high Low) / 3;

template int ternary_search(const ArrayLike& array, const T& value, int low, int high) { // Base case: if (high return -1; low) // General case: int one_third = low + (high - low) / 3; int two_thirds if (array[one_third] > value) { // if we should recurse on the 1st third = low + 2 * (high Low) / 3;

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

int main() { int inStock[10][4]; int alpha[20]; int beta[20]; int gamma[4] = {11, 13, 15, 17}; int delta[10] = {3, 5, 2, 6, 10, 9, 7, 11,1, 8};. . .} a. Write the definition of the function setZero that initializes any onedimensional array of type int to 0. b. Write the definition of the function inputArray that prompts the user to input 20 numbers and stores the numbers into alpha. c. Write the definition of the function doubleArray that initializes the elements of beta to two times the corresponding elements in alpha. Make sure that you prevent the function from modifying the elements of alpha. d. Write the definition of the function copyGamma that sets the elements of the first row of inStock to gamma and the remaining rows of inStock to three times the previous row of inStock. Make sure that you prevent the function from modifying the elements of gamma. e. Write the definition of the function copyAlphaBeta that stores alpha into the first five rows of inStock and beta into the…
Coding solution
Write a recursive function that returns True if the numerical array passed as input is palindrome, and False otherwise. An array is palidrome if its elements, when flipped, produce an array that is identical to the original one. For example: [1,2,3,2,1] is palindrome [1,2,3,4,3] is not palindrome Fill in the following code skeleton. It is composed of four parts: three base cases and the recursive call. Write code for all the parts. Assume that the input arrays can have any size, and that the elements are always positive integers.
param data * @return true if all items of the array are positive (more than 0), false otherwise. * return false if the array is null. */ public boolean allPositives(int[] data) without using functions
classHighArrayApp { public static void main(String[] args) { intmaxSize=100;// array size HighArrayarr;// reference to array arr=newHighArray(maxSize);// create the array arr.insert(77);// insert 10 items arr.insert(99); arr.insert(44); arr.insert(55); arr.insert(22); arr.insert(88); arr.insert(11); arr.insert(00); arr.insert(66); arr.insert(33); arr.display();// display items intsearchKey=35;// search for item if(arr.find(searchKey)) System.out.println("Found " + searchKey); else System.out.println("Can’t find " + searchKey); arr.delete(00);// delete 3 items arr.delete(55); arr.delete(99); arr.display();// display items again }// end main() }// end class HighArrayApp // highArray.java // demonstrates array class with high-level interface // to run this program: C>java HighArrayApp //////////////////////////////////////////////////////////////// class HighArray { private long[] a; // ref to array a private int nElems; // number of data items…
2 #include 3 #include 4 5 6 7 8 void printArray(int myArr[][ARRAY_COLS]) 9- { 10 11- 12 13- const int ARRAY_COLS = 10; 3; const int ARRAY_ROWS 14 15 16 17 18 } 19 20- /* 21 26 27 } 37 } 38 44 45 46 47 48 49 50 for (int i = 0; i < ARRAY_ROWS; i++) { 22 23 */ 24 void zeroCorners (int myArr[] [ARRAY_COLS]) 25 - { myArr[0][0] = 999; 51 52 } This function currently sets the upper-left-hand corder of the 2D array to 999 Instead, this should set all 4 corners of the 2-D array to zero. for (int j = 0; j < ARRAY_COLS; j++) { std::cout << myArr[i][j] << ", "; } 28 29 - /* 30 This function should Loop through every element in the 2-D array. If an element is odd, then subtract one from to make it even. 31 32 HINT: function printArray() is an example of Looping through every element in 2D array */ 33 34 void makeEven (int myArr[][ARRAY_COLS]) 35 - { 36 // TODO - put code here std::cout << "\n"; 53 54 } 55 39 int main() 40 - { 41 - 42 43 int arr[][ARRAY_COLS] { {1, 2, 3, 4, 5, 6, 7, 8, 9, 10),…
//Required Functionvoid func(int array_1[],int array_2[],int size){ for(int i=0;i<size;i++){ if(array_2[i]>array_1[i]){ array_1[i]=array_2[i]; } } return;} //main function to test the function.int main(){ int size=6; int a[]={1,5,9,8,7,6}; int b[]={1,4,10,12,7,15}; printf("First array before function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } func(a,b,size); //call to the created function printf("\nFirst array after function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } return 0;} 1. Write the statements to do the following: write a prototype for your function in the previous problem write a main function which includes the following steps declare two arrays of ints with 25 elements each prompt the user and read values into both arrays call your function from the previous problem print both arrays
In statistics, the mode of a set of values is the value that occurs most often or with the greatest frequency. Write a function that accepts as arguments the following: A) An array of integers B) An integer that indicates the number of elements in the array The function should determine the mode of the array. That is, it should determine which value in the array occurs most often. The mode is the value the function should return. If the array has no mode (none of the values occur more than once), the function should return −1. (Assume the array will always contain non negative values.) Demonstrate your pointer prowess by using pointer notation instead of array notation in this function.
// New Function prototypes void showValues(const int *, int); // display 10 numbers in a line from the array void fillArray(int *, int, int, int); // fill out random numbers between low and high into the array bool searchValue(const int *, int, int); // search value from the array void sortArray( int *, int); //sort the array in an ascending order void swap(int *, int *); //swap the values Modify the code below to create 50 random numbers instead of 10 and use the above new function protoypes. In the output, remove the display of the minimum, maximum and average from the array. Modify the showValues() function to display 10 numbers in a line from the array. [Part 2] Add the two functions to sort an array in an ascending order: void sortArray(int*, int); //ascending ordervoid swap(int*, int*); In the sortArray() function called the swap() function to swap the values from two elements in the array. Code: #include <iostream>#include <iomanip>#include…
Task 3: Statistics using arrays: by java programming With the spread of COVID 19, the HR department in a company has decided to conduct some statistics among the employees in order to determine the number of infections according to some conditions. For each employee, they have to record the code, name, age, whether he/she was infected or no and the remaining days of leaves for him/her. You are requested to write the program that maintains the lists of details for the employees as mentioned above using the concept of arrays. The program repeats the display of a menu of services until the user decides to exit. 1. Start by initializing the employee details by reading them from the keyboard. 2. Repeat the display of a menu of 4 services, perform the required task according to the user’s choice and asks the user whether he/she wants to repeat or no. You need to choose one service from each category (‘A’,’B’,’C’,’D’) a. A. Display the total number of employees that were infected b. B.…
Description of the assignment: Your program should read in a set of grades (that are all integers) entered by the user. The user will signify the end of the list of grades by entering -999. Do NOT process this value. You can assume that the user will enter at least three grades and not more than 100 grades, all of which will be integers in between 0 and 100, inclusive. For the set of grades, your program should compute the minimum value, print this out to two decimal places and remove it from the data. Then your program should compute the maximum value, print it out to two decimal places and remove it from the data. Then, your program should calculate the mean and standard deviation for the remaining set of grades, and print these out to two decimal places. Finally, a histogram for this data (without the highest and lowest grades) should be printed out as well. Your program should include the following functions: void readGrades (double grades [], int *n); /* This function reads an…
Assume that the following program segment is executed. What is the last element of testArray2 after the execution of the statement sortArray1(testArray2);? *