Given a sorted array containing 1, 2, 4, 8, 16, 32, 64, 128, 256, 512. Suppose we want to search for 512, a) How many comparisons are needed that compare the elements with 512 using Binary Search? b) How many comparisons are needed that compare the elements 512 using Linear Search?

Consider the following linear array: array=[-6,2,1,-5,-1,7,8] If you remove an element in index 2 and then insert an element in index 4, MINIMUM how many elements in total need to be shifted for the full operation? When an element in a particular index moves to its adjacent left or right index, it is counted as one shift. 7 8

solve it in 10 minutes

H3. Let S = [x1, x2, x3, ...xn], where n ≥ 5. How many ways can you choose five of the values in the array S, given that x1 = x2 = x3 and all other xi are distinct? The order of the chosen elements does not matter

If a linear search is performed on an array, and it is known that some items are searched for more frequently than others, how can the contents of the array be reordered to improve the average performance of the search?

Question: Given an array of integers, find the maximum sum of contiguous subarray (containing at least one number). Example: Input: [-2,1,-3,4,-1,2,1,-5,4] Output: 6 (Explanation: [4,-1,2,1] has the largest sum = 6)

Consider sorting n numbers stored in array A[1:n] by first finding the smallestelement of A[1:n] and exchanging it with the element in A[1]. Then find thesmallest element of A[2:n], and exchange it with A[2]. Then find the smallestelement of A[3:n], and exchange it with A[3]. Continue in this manner for thefirst n-1 elements of A. Write pseudocode for this algorithm, which is knownas selection sort. What loop invariant does this algorithm maintain? Why does itneed to run for only the first n-1 elements, rather than for all n elements? Give theworst-case running time of selection sort in big theta notation. Is the best-case runningtime any better?

Write programs for applying following operations on one-dimension array of integer: (1)    Linear search (2)    Binary search (3)    Bubble sort

Consider an array arr {12, 14, 17,18, 23, 24, 28, 33, 43). Show using diagram how element 12 can be searched from the array using Binary Search. Also calculate the number of searches needed to find the element 12?

1.a)Given an array which is sorted in descending [large to small] order and got no repeated numbers. You are asked to apply linear search. You are asked to find a number which exists. What should be the worst time complexity and why? b) A. Given the array of numbers 50 10 90 120 -13 3 89, you are asked to apply Binary Search to find a certain number. show the simulation and what would be the best achievable time complexity?