The text compares Radix and Quicksort as algorithms to show the effects of the number of items to

sort versus: $*$ instructions per item, $*$ clock cycles per item, and $*$ cache misses per item.

$($a$)$ What are the Radix and Quicksort algorithms?

$($b$)$ What sort of assumptions are not stated in the comparison