Suppose you have to search a key element from a list of array using divide and conquer technique, then which searching method is appropriate to use? Write the best case and worst case time complexity for the identified search.

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?

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

Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter 'A', 2nd array element stores the number of letter 'B', and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: O TwoWords - String word1 -String word2 O Exam_Q4 +TwoWords0 - static Scanner input +TwoWords(String word1, String word2) O+TwoWords(TwoWords tw) O+ String getWord10 O+ static void main(String args) O+ String getWord20 O+void setinfo(String word1, String word2) O -intj countinfo (String word) O+boolean...

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.

For selection sort, how many comparisons would be needed to sort an array containing 100 elements if the original array elements were already sorted? What if the original array elements were sorted in reverse order? What if the original array elements were all identical?

Given an array of integers and a positive integer k, find the maximum sum of any contiguous subarray of size k. For example, given the array [1, 2, 3, 4, 5] and k = 2, the maximum sum is 7, which is the sum of the subarray [4, 5] Please solve in C# language ..