Write a program that has an array of at least 20 integers. It should call a function that uses the linear search algorithm to locate one of the values. The function should keep a count of the number of comparisons it makes until it finds the value. The program then should call a function that uses the binary search algorithm to locate the same value. It should also keep count of the number of comparisons it makes. Display these values on the screen.

Write a program that has an array of at least 20 integers. It should call a function that uses the linear search algorithm to locate one of the values. The function should keep a count of the number of comparisons it makes until it finds the value. The program then should call a function that uses the binary search algorithm to locate the same value. It should also keep count of the number of comparisons it makes. Display these values on the screen.

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 44SA

See similar textbooks

Similar questions

You’re writing a function in C++ that accepts an array of distinct integers from 0, 1, 2, 3...up to N. However, the array will be missing one integer, and your function is to return the missing one. For example, this array has all the integers from 0 to 6, but is missing the 4: [2, 3, 0, 6, 1, 5] Therefore, the function should return 4. The next example has all the integers from 0 to 9, but is missing the 1: [8, 2, 3, 9, 4, 7, 5, 0, 6] In this case, the function should return 1. Using a nested-loops approach would take up to O(N^2). Your job is to optimize the code so that it has a runtime of O(N).
Write a function that gets an array as a parameter, sorts it in an ascending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position). Use c code int sortASC(int* myArray, int size) if array ={ 2, 3, 1, 0, -1} after calling the function the array should become {-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array)
use c code to Write a function that gets an array as a parameter, sorts it in a descending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position). int sortDESC(int* myArray, int size) if array = { 2, 3, 1, 0, -1} after calling the function the array should become {-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array) Hint: You need to make a copy of the array before sorting it!
(C language) Write a function intersect() that takes five arguments: an array of integers, number of elements in this array, a second array of integers, number of elements in the second array, a third array as parameters; finds the numbers in the first array that also exist in the second array and places these numbers into the third array; returns the number of matching values stored in array-3. Prototype: int intersect(int ar1[], int n1, int ar2[], int n2, int ar3[]) ps: please do not copy paste from chegg or anywhere else. write a unique code.
Write a function, remove, that takes three parameters: an array of integers, the number of elements in the array, and an integer (say, removeItem). The function should find and delete the first occurrence of removeItem in the array. (Note that after deleting the element, the number of elements in the array is reduced by 1.) Assume that the array is unsorted. Also, write a program to test the function. Your program should prompt the user to enter 10 digits for the array. Display the starting array to the user and prompt them to select an integer to remove. After the selected integer has been removed, the updated list should be displayed to the user. If the value does not exist or the array is empty, output the following message: x is not in the list
Hello, I am having trouble with this homework question for my course for intro to c++. Topic is on Array 2 Write a function definition for a function named getLast which does the following: 1) Accepts the array, size of the array and value as parameters. 2) Returns the last index of a value in an integer array. If the value does not exist in the array, return -1. Example Given the array {3, 6, 8, 3, 2, 6}. Given the value 6, this function getLast returns the value 5 which is the last index of 6 in the array.
write a program in c++ that prompts the used to enter 50 intergers and stores them in an array. the program then determines and outputs which numbers in the array are sum of the two other array elements. If an array element is the sum of two other array elements, then for this array element, the program should output all such pairs. use the below code to write the defention of the functions. #include <iostream> #include <iomanip> using namespace std; void initialize(double list[], int size); void print(double list[], int size); int main() { double alpha [50]; initialize(alpha, 50); print(alpha, 50); return 0; }
use c code to write a function that gets an array as a parameter, sorts it in an ascending fashion and returns the number of elements that did not change position in the sort (they were originally in the right position). int sortASC(int* myArray, int size ) if array ={ 2, 3, 1, 0, -1} after calling the function the array should become {-1, 0, 1, 2 , 3 } and the function should return 1 (only one element has not changed place in the array) Hint: the answer should need to link together with a c code and output
C++ Write the function with function header double searchId( int idl[], double scorel[], int id, int size) that recieves as arguments the arrays idl (array containing student's IDs) and scorel (array containing their test scores), a student's ID, and the size of the arrays. The arrays are such that the score of the student with ID idl[j] is score [j]. This function searches the array idl for the ID recived, and if it is found, it returns the corresponding test score; otherwise it returns -1. write the function main that does the following: 1.Define the arrays idlist to hold the IDs of 20 students (integer values), and scorelist to hold their test scores (double precision values) 2.Read the 20 student's IDs and their test scores from the standard input into the arrays idlist and scorelist respectively. Each input line will have an ID and a corresponding score. 3.Read the ID of a student and look for their test score (by calling function searchId(). 4.If the ID is found in the list (the…
In this assignment, rewrite the Bubble Sort, Selection Sort and Insertion Sort functions meeting the following requirements: Each function must be implemented using recursion Each function sorts a given array of numbers in descending order Your main program should be calling these functions with an unsorted array of numbers and then printing the results of the sorted array on the screen. You may test these functions using any data you deem appropriate. One example is to code main as follows: public static void main(String[] args) { int testArray1[] = {… (use your own test data) …}; int testArray2[] = {… (use your own test data) …}; int testArray3[] = {… (use your own test data) …}; recursiveBubbleSort(testArray1, …); printArray(testArray1); recursiveSelectionSort(testArray2, …); printArray(testArray2); recursiveInsertionSort(testArray3, …); printArray(testArray3); } “printArray” in this example…
In C++, Can you please look at the code below and revise/fix so it will work according to instructions and criteria. Instruction 1) Write a function that copies a 1D array to a 2D array. The function’s prototype is bool copy1DTo2D(int d1[], int size, int d2[][NCOLS], int nrows); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant size = NCOLS * nrows the function returns true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and 2d array indices is 2d row index = 1d array index / NCOLS 2d column index = 1d array index modulus operator NCOLS 2) Write a function that copies a 2D array to a 1D array. The function’s prototype is bool copy2DTo1D(int d2[][NCOLS, int nrows, int d1[], int size); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant the function return true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and…
Write a complete C++ code that inputs a character array (string) from a user. After taking input it callsa function Reverse() that reverses the string word by word as shown below:Original Character Array:Raining in summers makes your life prettyAfter calling Function Reverse():pretty life your makes summers in RainingNote: You have to use pointers in the function. You can use any builtin Cstring function of your choice for thistask.