Answer Happy

Multiple Choice Questions: 1. [1 point] Selection Sort is stable sorting algorithm. a) True b) False 2. [1 point] Starting from two sorted arrays with a combined total of n items, what is the time complexity for the most time-efficient algorithm for combining them into a new sorted array? a) O(1) b) O(n) c) O(log n) d) O(n log n) e) O(n) a 3. [1 point] Starting from two unsorted arrays with a combined total of n items, what is the time complexity for the most time-efficient algorithm for combining them into a new sorted array? a) O(1) b) O(n) c) O(log n) d) O(n log n) e) O(n) a 4. [1 point] Starting from two sorted arrays with a combined total of n items, what is the time complexity for the most time-efficient algorithm for finding the lowest valued item from either array? a) O(1) b) O(n) c) O(log n) d) O(n log n) e) O(n) 5. [1 point] Starting from two unsorted arrays with a combined total of n items, what is the time complexity for the most time-efficient algorithm for finding the lowest valued item from either array? a) O(1) b) O(n) c) O(log n) d) O(n log n) e) O(n)