The function, random_shuffle(), applied to vectors, is one that cplusplus.com states, "Rearranges the elements randomly... The complexity is linear in the distance between first and last." Distance indicates the number of elements between first and last. What would you say is the asymptotic complexity of random_shuffle?

A. O(n log n) B. O(1) C. O(n) D. O(n2)

````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````

Which sorting algorithm will almost never give the desired O(n log n) performance?

	A.	selection sort
	B.	heap sort
	C.	merge sort
	D.	quicksort

`````````````````````````````````````````````````````

In the best case, removing an element from a linked list is:

	A.	O(log n)
	B.	O(n2)
	C.	O(n)
	D.	O(1)