1 The quicksort algorithm has a worst-case running time of a O(n log n) b O(n2) 2 The merge sort has a worst-case running time of a O(n log n) b O(n2) 3 Which method of selecting a pivot would be...

1 The quicksort algorithm has a worst-case running time of

a O(n log n)

b O(n2)

2 The merge sort has a worst-case running time of

a O(n log n)

b O(n2)

3 Which method of selecting a pivot would be better for quicksort?

a Selecting the first item

b Selecting the median of the first three items, if there are three

4 The recursive step in an algorithm that processes a Lisp-like list runs on its

a first element

b the rest of the elements after the first one

5 The constructor function for a Lisp-like list is named

a head

b tail

c cons