One of the class of O(1) and O(n) sorting algorithms (Others include
Guess sort,
Trust-me-on-this-one sort,
Tao sort and
In-time-for-the-deadline sort) the Zen sort is considered one of the prime accomplishments of
drug use in the field of
computer science
Algorithm for Zen sort:
- Accept array of size n containing values to sort.
- Initialize new array of size n to place ordered values in
- For each item in first list
- Consider inner nature until sorted location is clear
- Copy to appropriate location in new list
- return new list