Solve these algorithms analysis questions:

Super-Stooge Sort Homework Answered Due Today, 11:59 PM What is the time complexity of a Super-Stooge Sort which recursively sorts the first 2/3 of the elements, then the last 2/3 of the elements, then the first 2/3 of the elements, then the last 2/3 of the elements? Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer. a (nlgn) where lg is "log base 4 " b (nlgn) where lg is "log base 3/2 " c (nlgn) where lg is "log base 2/3 d (nlg4) where lg is "log base 2/3 e (nlg4) where lg is "log base 3/2 f (nlg3/2) where lg is "log base 4" Answered Homework Answered Due Today, 11:59 PM Which are true of Bubble Sort (basic implementation, without optimizations)? (i) Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... SHOW MORE a It uses (n2) comparisons in the worst case b It uses (n2) comparisons in the average case c It uses (n2) comparisons in the best case d It uses (n2) swaps in the worst case e It uses (n2) swaps in the average case f It uses (n2) swaps in the best case Homework Answered Due Today, 11:59 PM Which are true of Selection Sort? Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... SHOW MORE a It uses (n2) comparisons in the worst case b It uses (n2) comparisons in the average case c It uses (n2) comparisons in the best case d It uses (n2) swaps in the worst case e It uses (n2) swaps in the average case f It uses (n2) swaps in the best case Answered Insertion Sort Homework Answered Due Today, 11:59 PM Which are true of Insertion Sort (traditional implementation, without optimizations)? Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... SHOW MORE a It uses (n2) comparisons in the worst case b It uses (n2) comparisons in the average case c It uses (n2) comparisons in the best case d It uses (n2) movements of elements in the worst case f It uses (n2) movements of elements in the best case Homework Answered Due Today, 11:59 PM Which are true of Insertion Sort, using Binary Search instead of Linear Search to find the points of insertion? Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... SHOW MORE a It uses (nlogn) comparisons in the worst case b It uses (nlogn) comparisons in the average case c It uses (nlogn) comparisons in the best case d It uses (nlogn) movements of elements in the worst case e It uses (nlogn) movements of elements in the average case f It uses (nlogn) movements of elements in the best case Answered Insertion Sort - Best Case Homework - Answered - Due Today, 11:59 PM When will Insertion Sort achieve its best case? Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer. a The data is already sorted in ascending order b The data is already sorted in descending order c The data is comprised of two successive sorted lists each of length n/2 d The data is in a random order Answered Merge - one call Homework Answered Due Today, 11:59 PM Which of the following are true about the number of comparisons in one call to Mergesort's Merge method? Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... SHOW MORE a (n) in the best case b (n) in the average case c (n) in the worst case d None of the above Answered Merge - all calls Homework Answered Due Today, 11:59 PM Which of the following are true about the number of comparisons in all calls to Mergesort's Merge method (over the entire course of the Mergesort algorithm)? (i) Multiple answers: Multiple answers are accepted for this question. Select one or more answers and submit. For keyboard navigation... SHOW MORE a (nlogn) in the best case b (nlogn) in the average case c (nlogn) in the worst case d None of the above Answered Streaks Homework - Answered Due Today, 11:59 PM Define a "streak" as a subarray of consecutive elements whose elements are sorted in ascending order. If an array has n (nonoverlapping) streaks, what must be true of the data? Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer. a The data is sorted in ascending order b The data is sorted in descending order c The data consist of two sorted lists each of length n/2 d The data is in a random order Answered Recurrence T(n)=4T(2n/3)+5 Homework Unanswered Due Today, 11:59 PM Which substitution should best be used in solving the recurrence T(n)=4T(2n/3)+1 ? Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer. a n=2k b n=3k n=4k d n=5k e n=(2/3)k f n=(3/2)k Recurrence T(n)=3T(n1)+1 Homework Unanswered Due Today, 11:59 PM Which transformation(s) should be made to solve the recurrence T(n)=3T(n1)+1 ? Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer. a Domain transformation b Range transformation c Domain and range transformation d Neither domain nor range transformation Unanswered