Language: CImplement the binary search algorithm, to find an integer in a sorted array. a) Declare an array of N integers. Use the preprocessor #define directive for the size of the array. Let the first element be 0. Fill the array, by assigning to each element the value of the previous element plus a pseudorandom, nonnegative number. b) Given a sorted array of N integers, write a function to recursively search for a given element x in and return the index of x in the array, or -1 if the element is not found. To this end, divide the interval into two halves. If the value of the element is less than the item in the middle of the interval, search further in the lower half of the interval, otherwise, search it in the upper half. c) Test your results, searching for randomly picked element from the array. Problem 4:Implement the binary search algorithm, to find an integer in a sorted array.a) Declare an array of N integers. Use the preprocessor #define directive for the size of thearray. Let the first element be 0. Fill the array, by assigning to each element the value of theprevious element plus a pseudorandom, nonnegative number.b) Given a sorted array of N integers, write a function to recursively search for a given elementx in and return the index of x in the array, or -1 if the element is not found. To this end, dividethe interval into two halves. If the value of the element is less than the item in the middle of theinterval, search further in the lower half of the interval, otherwise, search it in the upper half.c) Test your results, searching for randomly picked element from the array.

Code is attached in step 2 along with a screenshot.

Language: C Implement the binary search algorithm, to find an integer in a sorted array. a) Declare an array of N integers. Use the preprocessor #define directive for the size of the array. Let the first element be 0. Fill the array, by assigning to each element the value of the previous element plus a pseudorandom, nonnegative number. b) Given a sorted array of N integers, write a function to recursively search for a given element x in and return the index of x in the array, or -1 if the element is not found. To this end, divide the interval into two halves. If the value of the element is less than the item in the middle of the interval, search further in the lower half of the interval, otherwise, search it in the upper half. c) Test your results, searching for randomly picked element from the array.

Language: C Implement the binary search algorithm, to find an integer in a sorted array. a) Declare an array of N integers. Use the preprocessor #define directive for the size of the array. Let the first element be 0. Fill the array, by assigning to each element the value of the previous element plus a pseudorandom, nonnegative number. b) Given a sorted array of N integers, write a function to recursively search for a given element x in and return the index of x in the array, or -1 if the element is not found. To this end, divide the interval into two halves. If the value of the element is less than the item in the middle of the interval, search further in the lower half of the interval, otherwise, search it in the upper half. c) Test your results, searching for randomly picked element from the array.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter10: Pointers

Section10.4: Passing Addresses

Problem 4E

See similar textbooks

Similar questions

Section A: Multiple Choice Questions : Q1: Consider searching element 45 using binary search in an array A [ ] = { 23, 34, 45, 67, 78, 54, 87, 91 }. The returned index would be a) Index [0] b) Index [2] c) Index [3] d) None of these Q2: In the context of recursive search a) Recursion terminates when the item is found b) Same function is called again and again c) Slower than iterative search d) All options are correct Q3: Which one of the following is an approach for a systematic trial and error to search an item? a) Binary search b) Backtracking c) Recursion d) Iteration Q4: In terms of time efficiency, the following method is ____. public int function(int n) { int result = 1; for (int k = 1; k returnType methodName(methodParameters) c) methodModifiers returnType methodName (methodParameters) d) methodModifiers returnType methodName(methodParameters) Q8: Given a function f(n) = n2 + 20n on an input parameter n, which of the following is true a) f(n)=O(1) b) f(n)=O(n) c)…
Instructions Write a recursive function to implement the recursive algorithm of Exercise 16 (reversing the elements of an array between two indices). Also, write a program to test your function. Your program should prompt the user for the integers in the array, as well as the low index and then the high index. The instructions from Exercise 16 have been included below for your convenience: Suppose that intArray is an array of integers, and length specifies the number of elements in intArray. Also, suppose that low and high are two integers such that 0 <= low < length, 0 <= high < length, and low < high. That is, low and high are two indices in intArray. Write a recursive definition that reverses the elements in intArray between low and high
Instructions Write a recursive function to implement the recursive algorithm of Exercise 16 (reversing the elements of an array between two indices). Also, write a program to test your function. Your program should prompt the user for the integers in the array, as well as the low index and then the high index. The instructions from Exercise 16 have been included below for your convenience: Suppose that intArray is an array of integers, and length specifies the number of elements in intArray. Also, suppose that low and high are two integers such that 0 <= low < length, 0 <= high < length, and low < high. That is, low and high are two indices in intArray. Write a recursive definition that reverses the elements in intArray between low and high. Textbook: C++ Programming: From Problem Analysis to Program Design 8th Edition Publisher: Cengage Learning Edition ISBN: 9781337102087
4. Insertion Sort• The idea with an insertion sort is that a sorted region grows one item at atime, by inserting an item into its correct position within the sorted region.• As done in Part 1, fill an array with random numbers.• Write a function that inserts an item into a sorted region of an array. Passthe function the index of the item to be inserted (i.e. the index of the firstitem in the unsorted region). Insert that item by shifting items over oneposition, until you have found the correct location to insert the item.• E.g. if given a = [2 5 8 9 6 3 7] and the index 4, a[4] should be inserted into thesorted portion, giving [2 5 6 8 9 3 7]• Write a second function that calls the first function repeatedly, until theentire array is sorted. (Each time the first function is called, it will insert anitem into a larger sorted region.)
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.
Q1. Write a program to sort the elements of 1D array in descending order and also implement linear search on the same array. Both sorting and searching operations should be done inside one user defined function: “Task”. So, for achieving the required functionality, pass, array into the function: Task () from main () using Pass by reference/ or address approach.
IN C++ Instructions Write a recursive function to implement the recursive algorithm of Exercise 16 (reversing the elements of an array between two indices). Also, write a program to test your function. Your program should prompt the user for the integers in the array, as well as the low index and then the high index. The instructions from Exercise 16 have been included below for your convenience: Suppose that intArray is an array of integers, and length specifies the number of elements in intArray. Also, suppose that low and high are two integers such that 0 <= low < length, 0 <= high < length, and low < high. That is, low and high are two indices in intArray. Write a recursive definition that reverses the elements in intArray between low and high
Write a recursive function to implement the recursive algorithm of Exercise 16 (reversing the elements of an array between two indices). Also, write a program to test your function.
1. Rewrite the Bubble sort to use recursion. 2. Use the time(0) function to determine how many seconds it takes to sort a vector using the recursive method. 3. Use the time(0) function to determine how many seconds it takes to sort a vector using the non-recursive method described in the videos. Run the sort test on vectors containing random integers. You should sort vectors of the following sizes: 100 elements, 1000 elements, 5,000 elements, 10,000 elements and 50,000 elements. Was the recursive method able to work on vectors of each of those sizes? If not, explain why it errored.
1. Rewrite the Bubble sort to use recursion. 2. Use the time(0) function to determine how many seconds it takes to sort a vector using the recursive method. 3. Use the time(0) function to determine how many seconds it takes to sort a vector using the non-recursive method described in the videos. Run the sort test on vectors containing random integers. You should sort vectors of the following sizes: 100 elements, 1000 elements, 5,000 elements, 10,000 elements and 50,000 elements. Was the recursive method able to work on vectors of each of those sizes? If not, explain why it errored. 4. Create a class that will store a vector of planets (See the Planet assignment). Your class will have functions to add a planet, delete a planet and sort the planets. The class must utilize the insertion sort.
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software
Q#2 Write a recursive function zeroCount ( int a[ ], int s, int e) that receives an array of integers a [], a start index s, and an end index e. The function should return the number of zeros in that array between s and e. int zeroCount ( int a[ ], int s, int e); Trace your function given the following array and function call. Draw your steps. int a[ ] = {1, 0, 0, 5}; int zeros = zeroCount(a, 0, 3); language c++