True or False: Suppose we run Quicksort on a sorted array of distinct elements. Suppose our pivot selection is always the last element. Suppose we do not shuffle. Suppose we use Tony Hoare style partitioning. Given these suppositions, Quicksort will take N² time. True False True or False: Quicksort can be made stable using a partitioning scheme which involves 3 different arrays: one array for items less than the pivot, one array for items equal to the pivot, and one array for items greater than the pivot. True False True or False: Heapsort is empirically just as fast as merge sort. True False True or False: Finding and using the median element of every partition as the pivot will usually result in an empirically faster quicksort than a quicksort that uses a random pivot selection strategy. True False True or False: The following sort is stable: We split an array up into two halves and run insertion sort on each half. Then we merge the halves together like we do in merge sort. True False

True or False: Suppose we run Quicksort on a sorted array of distinct elements. Suppose our pivot selection is always the last element. Suppose we do not shuffle. Suppose we use Tony Hoare style partitioning. Given these suppositions, Quicksort will take N² time. True False True or False: Quicksort can be made stable using a partitioning scheme which involves 3 different arrays: one array for items less than the pivot, one array for items equal to the pivot, and one array for items greater than the pivot. True False True or False: Heapsort is empirically just as fast as merge sort. True False True or False: Finding and using the median element of every partition as the pivot will usually result in an empirically faster quicksort than a quicksort that uses a random pivot selection strategy. True False True or False: The following sort is stable: We split an array up into two halves and run insertion sort on each half. Then we merge the halves together like we do in merge sort. True False