Lazy SORT is a sorting method that came to me in a dream (No joke). Here is how it works: List A: [1, 5, 8, 6] List B: [] 1) Add the max element N (8) to List B. So, List B's length will be 8 and it will contain empty symbols. 2) Add the element value into the index of List B. So an element "6" will be inserted to index 6 of list B, and so on and so forth. List B is now: [1, -, -, -, 5, 6, 8] 3) The final step is simply removing the useless items. List B is now: [1, 5, 6, 8] and happily sorted. [!!!] One very dangerous caveat is having duplicate elements. [1, 5, 6, 6] The algorithm will insert 6 to the sorted list. This will only result in one 6 making it to the sorted list.
This is not my birthday project btw. That will be published later today.
