Given the following sorted array: -6 0 6 12 18 19 20 30 40 Show all...
Given the following sorted array:
| -6 | 0 | 6 | 12 | 18 | 19 | 20 | 30 | 40 |
Show all the stages of running the binary search algorithm (either recursive OR iterative) to find the number 30 (code is not required, but indicate the mid, left and right indexes at each stage).
Homework Answers
Add Answer to:
Given the following sorted array:
-6
0
6
12
18
19
20
30
40
Show all...
JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized...
JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 int[] numbers = {-30, -9, -6, -4, -2, -1, 0, 2, 4, 10, 12, 17, 22, 30}; // search for the value -5 int index = binarySearch(numbers, -5); Write the indexes of the elements that would be examined by the binary search (the mid values...
1. Please write a Divide-and-Conquer Java algorithm solving the following problem: Given an "almost sorted" array...
1. Please write a Divide-and-Conquer Java algorithm solving the following problem: Given an "almost sorted" array of distinct integers, and an integer x, return the index of x in the array. If the element x is not present in the array, return -1. "Almost sorted" means the following. Assume you had a sorted array A[0…N], and then split it into two pieces A[0…M] and A[M+1…N], and move the second piece upfront to get the following: A[M+1]…A[N]A[0]…A[M]. Thus, the "almost sorted"...
JH: Student Name: 4) Given the following array, do the following (show all the work). A...
JH: Student Name: 4) Given the following array, do the following (show all the work). A (56, 89, 23, 58, 22, 11, 45, 48, 90) (a - 5 pts) Construct a hash table for the given array using the hash function H(K)- K mod 5 (b- 4 pts) Determine the average number of comparisons for a successful search using the hash table of (c -3 pts) What is the worst case number of comparisons for an unsuccessful search in the...
You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4]...
You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4] [5] [6] [7] 6 9 17 29 33 41 58 61 [8] [9] [10] [11] [12] [13] 67 87 93 112 118 145 We want to find 12 in the given array, using binary search algorithm. The first comparison will be made with ----- 6 58 61 None. 12 is not in the array.
Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this...
Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this a max heap, draw the tree and check if this is a max heap. b) Illustrate how you would add a new data 46 to the existing maxheap. c) From the answer obtained in part b, illustrate how you would delete the data 40 d) Now illustrate heap sort with the existing data after step c. Give steps, and find runtime. Runtime|Explanation of Algorithm...
Given the contents of a sorted array of size 6, shown below, show which indices of...
Given the contents of a sorted array of size 6, shown below,
show which indices of the array will be visited,
and in what order, if the algorithm BinarySearch
was to be performed on this array for the number 4.
int theArray[] = {1, 2, 3, 6, 8, 9};
Following are example question &
answer:
Given the contents of a sorted array of size 7, shown below, show which indices of the array will be visited, and in what order,...
17) Which of the following is a valid binary search tree? 23 12 40 19 30...
17) Which of the following is a valid binary search tree? 23 12 40 19 30 61 13 21 41 50 23 43 10 18 34 51 15 21 40 50 23 43 10 18 51 15 27 40 50 What is the worst-case runtime of searching for a value in a binary search tree? (a) constant O(1) (b) logarithmic O(logn) (c) linear O(n) 18) Pag
please help urgent c++ Use the vector/array below for the following tasks: {25, 39, 12, 85,...
please help urgent c++
Use the vector/array below for the following tasks: {25, 39, 12, 85, 55, 69, 40, 75} Task1 - [2 points] Put your name on the top comment section as the author of this code. For example, // Author: (Your name] Task2 – [5 points] Display (cout) the elements that are greater than 40 in the array. Task 3 - [5 points] Sort the given input array in an ascending order using any sort algorithm learned from...
Implement the algorithm maxArray, discussed in Section 2.4.3, as a C++ function. Make sure the following...
Implement the algorithm maxArray, discussed in Section 2.4.3, as
a C++ function.
Make sure the following requirements are met.
Program must compile and run.
maxArray function must be a recursive template function.
Add a main function to test the maxArray function so that you
have a complete program.
Test the maxArray function on two arrays of different
types.
Name the program maxarray.cpp. Make sure the following
requirements are met.
2.4.3 Finding the Largest Value in a Sorted or Unsorted Array...
3. Write the function find sorted elt whose input is a vector sorted in increasing order...
3. Write the function find sorted elt whose input is a vector sorted in increasing order and an element x. The output is 0 if the element x does not occur in v, 1 if the element x does occur in v. Below is the algorithm you should implement, known as the binary search algorithm. Note that the code below returns the index, but we want to return true or false, not the index, so adjust your code accordingly. Algorithm....
JH: Student Name: 4) Given the following array, do the following (show all the work). A (56, 89, 23, 58, 22, 11, 45, 48, 90) (a - 5 pts) Construct a hash table for the given array using the hash function H(K)- K mod 5 (b- 4 pts) Determine the average number of comparisons for a successful search using the hash table of (c -3 pts) What is the worst case number of comparisons for an unsuccessful search in the...
You are given an array containing integers in the sorted order: [O] [1] [2] [3] [4] [5] [6] [7] 6 9 17 29 33 41 58 61 [8] [9] [10] [11] [12] [13] 67 87 93 112 118 145 We want to find 12 in the given array, using binary search algorithm. The first comparison will be made with ----- 6 58 61 None. 12 is not in the array.
Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this a max heap, draw the tree and check if this is a max heap. b) Illustrate how you would add a new data 46 to the existing maxheap. c) From the answer obtained in part b, illustrate how you would delete the data 40 d) Now illustrate heap sort with the existing data after step c. Give steps, and find runtime. Runtime|Explanation of Algorithm...
Given the contents of a sorted array of size 6, shown below,
show which indices of the array will be visited,
and in what order, if the algorithm BinarySearch
was to be performed on this array for the number 4.
int theArray[] = {1, 2, 3, 6, 8, 9};
Following are example question &
answer:
Given the contents of a sorted array of size 7, shown below, show which indices of the array will be visited, and in what order,...
17) Which of the following is a valid binary search tree? 23 12 40 19 30 61 13 21 41 50 23 43 10 18 34 51 15 21 40 50 23 43 10 18 51 15 27 40 50 What is the worst-case runtime of searching for a value in a binary search tree? (a) constant O(1) (b) logarithmic O(logn) (c) linear O(n) 18) Pag
please help urgent c++
Use the vector/array below for the following tasks: {25, 39, 12, 85, 55, 69, 40, 75} Task1 - [2 points] Put your name on the top comment section as the author of this code. For example, // Author: (Your name] Task2 – [5 points] Display (cout) the elements that are greater than 40 in the array. Task 3 - [5 points] Sort the given input array in an ascending order using any sort algorithm learned from...
Implement the algorithm maxArray, discussed in Section 2.4.3, as
a C++ function.
Make sure the following requirements are met.
Program must compile and run.
maxArray function must be a recursive template function.
Add a main function to test the maxArray function so that you
have a complete program.
Test the maxArray function on two arrays of different
types.
Name the program maxarray.cpp. Make sure the following
requirements are met.
2.4.3 Finding the Largest Value in a Sorted or Unsorted Array...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 11 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 11 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 11 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 11 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 11 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 11 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 11 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 11 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 11 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 11 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 11 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 11 months ago