Which of the following sorting algorithms has the fastest average time complexity? Group of answer choices Selection Sort Insertion Sort Merge Sort   2. We use dynamic programming approach when the solution has optimal substructure. Group of answer choices True False 3. Which one is the data structure used in standard implementation of Breadth First Search? Group of answer choices Stack Queue Linked List 4. What is the Time Complexity of Depth First Search? (V – number of vertices, E – number of edges) Group of answer choices O(V+E) O(V*E) O(V) O(E)   5. What is the output of the below code? np.arange(2,8) Group of answer choices array([2, 3, 4, 5, 6, 7]) array([2, 3, 4, 5, 6, 7, 8]) array([3, 4, 5, 6, 7, 8])

Please justify your answer: Some sorting algorithms require extra space, apart from the space needed for the original  array that needs to be sorted. Which one of the following statements on the space usage of  sorting algorithms is correct?  a.)  A Heapsort for sorting an array of size N requires an amount of extra space proportional  to N.   b.)  Insertion Sort for sorting an array of size N requires an amount of extra space  proportional to N.   c.)  Merge sort for sorting an array of size N requires an amount of extra space proportional  to N.   d.) Quicksort for sorting an array of size N requires an amount of extra space proportional  to N.   e.) None of the above

Is searching with pre-sorting usually worse or better than sequential search in time complexity? [Select] Which is more useful in practice since we usually do more lookups after a one-time sorting? [Select] What kind of search do we apply for its efficiency? [Select] [Select] binary search decimal search How much time does it take for the worst case whe [Select]

Moe, Larry and Curly have just purchased three new computers and use three different algorithms to sort lists: Comparisons / sec Search Algorithm T(n) Мое 50 Linear Search n Larry 5 Curly 1 Optimal Chunk Search 2/n Binary Search log2 n where T(n) is the number of comparisons it takes, in the worst case, to sort a list of size n. How large must n be to ensure that, for every list, ... i Curly's computer sorts faster than Moe's? ii Larry's computer sorts faster than Moe's?