Jota’s Reviews > Introduction to the Design and Analysis of Algorithms: International Edition > Status Update

Assuming that the range of values is fixed, this is obviously a linear algorithm because it makes just two consecutive passes through its input array. This is a better time-efficiency than that of the most efficient sorting algorithms - mergesort, quicksort, and heapsort - we have encountered. It is important to remember, however, that this efficiency is obtained by exploiting the specific nature of the inputs.