Of the n ! possible inputs to a given comparison-based sorting algorithm, what is the absolute maximum number of inputs that could be correctly sorted with just n comparisons?   Jonathan has a...

Of the
n! possible inputs to a given comparison-based sorting algorithm,

what is the absolute maximum number of inputs that could be correctly

sorted with just
n
comparisons?

Jonathan has a comparison-based sorting algorithm that sorts the first
k

elements of a sequence of size
n
in
O(n) time. Give a big-Oh characterization

of the biggest that
k
can be?

Is the bucket-sort algorithm in-place? Why or why not?