Given an array A that contains the following elements in this order 45, 2, 18, 7,...

Given an array A that contains the following elements in this order 45, 2, 18, 7, 23, 47, 3, 15, 32:

(a) Build a min-heap using the bottom-up (reverse) method, showing your work. How many comparisons do you make?

(b) Build a min-heap using the top-down (forward) method, showing your work. How many comparisons do you make?

(c) Are the two heaps that you get identical? Is this a coincidence of this particular instance? Or would the same happen for other instances? Explain in your own words whether the two methods will in general produce identical heaps or not.

Expert Solution

both trees are identical same and number of swaps are equal

I am mentioning producer in option C

Anything doubtful or not understand just comment

I will touch with you

Don't be dislike

Thank you and all the best

venereology answered 1 month ago

45. Which statement correctly passes the array items to method takeArray? Array items contains 10 elements....

45. Which statement correctly passes the array items to method takeArray? Array items contains 10 elements. a. takeArray(items[9]) b. takeArray(items[]) c. takeArray(items) d. Arrays cannot be passed to methods – each item must be sent to the method separately. 46. When an argument is passed by reference, ____________. a. a copy of the argument’s value is passed to the called method b. the original value is removed from memory c. changes to the argument do not affect the original variable’s...

Given the following array of 8 elements, show the steps to sortthe elements in ascending...

Given the following array of 8 elements, show the steps to sort the elements in ascending order using a radix sort. Fill in each of the following blanks.81 546 677 9 97 12 53 22Adjust with 0s:Buckets for ones digit:Buckets for tens digit:Final Result:

The following code was meant to print out the elements in an array in reverse order....

The following code was meant to print out the elements in an array in reverse order. However, it does not behave correctly. public static void reverse(int[] a, int index) { if (index == (a.length - 1)) System.out.printf("%d%n", a[index]); else { reverse(a, index); What does it do? Explain why it behaves in this way and There is more than one error in the code. Correct the code so that it will recursively print out the elements of...

Question 2. The following code defines an array size that sums elements of the defined array...

Question 2. The following code defines an array size that sums elements of the defined array through the loop. Analyze the following code, and demonstrate the type of error if found? What we can do to make this code function correctly? #include <stdio.h> #define A 10 int main(int argc, char** argv) { int Total = 0; int numbers[A]; for (int i=0; i < A; i++) numbers[i] = i+1; int i =0; while (i<=A){ Total += numbers[i]; i++; }...

// Given an int array of size elements, determine if there are k elements that add...

// Given an int array of size elements, determine if there are k elements that add up to sum. // The array holds integers, both positive and negative and zero. // It is not possible to add zero elements (that's when k==0) to any sum, not even zero. // It is not possible to add any elements from an empty array. // Must be recursive and not iterative //bool K_element_sum(size_t k, int sum, int arr[], size_t size){}

Suppose you are given the following array X = [7, 9, 1, 6] Sort the array...

Suppose you are given the following array X = [7, 9, 1, 6] Sort the array in ascending order using the selction sort algorithm. Write the state of the array after each pass. Pass1: Pass2: Pass3: Suppose you are given the following array X = [7, 9, 1, 6] Sort the array in ascending order using the selction sort algorithm. Write the state of the array after each pass. Pass1: Pass2: Pass3:

1. Given an array of integers a dimension n. If the array contains the same number...

1. Given an array of integers a dimension n. If the array contains the same number of even and odd elements get (a1 + an) (a2 + an-1) ... 2. Given an array of integers dimension n. All array elements with even numbers preceding the first element to the maximum, multiplied by the maximum. 3. Given an array of dimension n. Insert after each zero element of the element in the middle (or the amount of secondary elements for even...

Write C program that reorders elements of an array of integers such that the new order...

Write C program that reorders elements of an array of integers such that the new order is in descending order (first number being the largest). Must have a main function and a swap function. - int main() will declare an array with the values { 32, 110, 79, 18, 22, 2}. This array will be passed to the swap function. - the void swap function will perform the necessary operations to reorder the elements of the array. - After swap()...

The following code was meant to print out the elements in an array in reverse order. However, it does not behave correctly.

The following code was meant to print out the elements in an array in reverse order. However, it does not behave correctly. public static void reverse(int[] a, int index) { if (index == (a.length - 1)) System.out.printf("%d%n", a[index]); else { reverse(a, index); What does it do? Explain why it behaves in this way. There is more than one error in the code. Correct the code so that it will recursively print out...

An array A[0..n - 2] contains n-1 integers from 1 to n in increasing order. (Thus...

An array A[0..n - 2] contains n-1 integers from 1 to n in increasing order. (Thus one integer in this range is missing.) Design an algorithm in (Theta(log n)) to find the missing integer. Your algorithm should be given in pseudo code. For example, the array A could be {1, 2, 3, 4, 6, 7, 8, 9, 10} in which 5 is missing.

Question