One of the class of O(1) and O(n) sorting algorithms (Others include
Guess sort,
Trust-me-on-this-one sort,
Zen sort and
In-time-for-the-deadline sort) the Tao sort took some serious chilling to invent. It is generally considered by experts to be a really cool algorithm, or as one expert was quoted saying about the inventor of this algorithm, “Man, I bet that dude gets loads of it. I mean he must be
really beautiful to have survived with
a brain like his”
Algorithm for Tao sort:
- Accept list of size n containing values to sort.
- Redefine order according to list