Use hardware to sort
data independent sorting method (only when smaller than specific input size)
- runtime does not vary
- rigid and deterministic
Hardware Comparator complexity does not dependent on input size and just dependent on fixed value (transistor count)
Parallelize comparators so we can achieve clocks
Sorting Network Usages
Sorting Network Notion
Software based sorting networks
- Merge Sort
- implement merging network using comparator
- 2 input merger is same as comparator so
Sorting network
In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks.
https://en.wikipedia.org/wiki/Sorting_network

Seonglae Cho