Answer Happy

Question 9 Question 2a Question 2 (a-e) is about sorting. Mark each of the following statements as either true or false: • Quicksort is a dynamic programming algorithm. Mergesort is a divide-and-conquer algorithm. • Radixsort is a divide-and-conquer algorithm. • Heapsort requires a tree datat structure in order to store the tree representation of the input array. • Heapsort has a runtime of O(n) on an input array A of length in with A - 1. for every i. No sorting algorithm can sort an array of length in consisting of distinct integers taken from the set 1, 2,..., n¹0 in time O(n). Radixsort uses a stable sorting algorithm as a subroutine. • The best-case, average-case and worst-case runtimes of Mergesort are identical (in big-notation). • Countingsort counts how often each element appears in the input array.