Can Sorting Be Faster Than O(n log n)? | Count Sort
Jenny's Lectures CS IT · 2:12
This clip explains that counting sort runs in O(n + k) time, where *n* is the number of input elements and *k* is the range of values (the maximum element, i.e., the size of the count array). When k is small compared...