Linear Time Sorting
- Tags
- comp-sci
Is a class of sorting algorithms which by-pass the lower-bound of comparison based sorting by using more data or [see page 15, exploiting] the type of the information being sorted.
Is a class of sorting algorithms which by-pass the lower-bound of comparison based sorting by using more data or [see page 15, exploiting] the type of the information being sorted.