Merge sort algorithm is about to complete the sort and is at the point just before the last merge. At this point, elements in each half of the array are sorted amongst themselves.   Illustrate the above statement by looking at the array of the following ten integers: 5 3 8 9 1 7 0 2 6 4 and drawing the array before the final merge sort is completed (sorting from Smallest to largest)

c++

Assume that we have a sorted list in an array: Index:         0       1       2         3       4        5      6      7      8       9        10        11 numbers:   12     15     17      19     22      26    28   30    32     34       36       38 we want to use the binary search algorithm to find the value 19 in the list. What would be the indexes of the array that the binary search would check to find the value 19  the indexes and not the actual numbers in the list otherwise

Please written by computer source

The contents of the array below represent a BST (Binary Search Tree). What would be the contents of the array after 30 is deleted. Briefly explain how 30 would be deleted. Use an X to represent any empty spots in the array. 30 2050 10 25 40 60

Assume nums is an array of integers that looks like this: -3 12 9 0 2 -1 If we are sorting from smallest to largest, what will nums look like after 2 times through the outside loop if we are using bubble sort? Note: When you're entering the values, make sure you leave at least one space between them. Would it be possible to perform a linear search on a 2-D array? Answers: Yes, but you would be limited to using only one loop No, because a 2-D array is not stored in linear fashion in RAM Yes, as long as you used the proper nested loops No, you would have to use a binary search Yes, but only if the array's elements were sorted

The algorithm: –In an array of n elements, go to index [n/2] –If the record there is the one you want, you are done –If the record value there is smaller than your search value, all records less than the current record can be ignored – set your search range of elements to [n/2+1…n] and return to step 1 –Otherwise, set your range of elements to [0…(n/2)-1] and return to step 1 –Repeat this loop until you have 0 elements (record is not found) or record is found Short answer Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.

1. Write an algorithm to determine whether a given element x belongs to a set S := {s1, . . . , sn}.

Lab 16 Implementing bubble sort In this lab, you will implement the bubble sort algorithm. The bubble sort is so called because it compares adjacent items, "bubbling" the smaller one up toward the beginning of the array. By comparing all pairs of adjacent items starting at the end of the array, the smallest item is guaranteed to reach the beginning of the array at the end of the first pass.The second pass begins again at the end of the array, ultimately placing the second smallest item in the second position. During the second pass, there is no need to compare the first and second items, because the smallest element is guaranteed to be in the first position.Bubble sort takes at most n - 1 passes for an array of n items. During the first pass, n - 1 pairs need to be compared. During the second pass, n - 2 pairs need to be compared. During the ith pass, n - i pairs need to be compared. During the last pass, n - (n - 1) or one pair needs to be compared. If, during any pass, no two…

Write the algorithm which sorts the array by using the merge sort algorithm. Then find the complexity of the algorithm as Big O notation.