Back to all chapters
# Sorting Algorithms

Highly-organized data can be critical for many algorithms, and often you want your data ordered from least to greatest. The art of getting your data in order is trickier than you might think!

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)\).

×

Problem Loading...

Note Loading...

Set Loading...