Computer Science
# Sorting Algorithms

Suppose we have an array with $n$ elements and $k$ is the size of the largest key. When would it be a bad idea to use counting sort to sort this array?

**Details and assumptions**

$k = O(f(n))$ means $k$ is bounded by the function $f(n)$.