Skip to content

Intelligent Design Sort

Jump to bottom
Aashish Bharadwaj edited this page Mar 17, 2018 · 4 revisions

Average time complexity - O(1)

Best-Case time complexity - Θ(0)

Worst-Case time complexity - Θ(1)

Worst-case space complexity - O(1)

  • This is satire. I respect the right for anyone to hold any opinion on any topic.

Intelligent Design Sort is a holy sorting algorithm that is based on the theory that the array in question is intelligently designed, and therefore is already sorted.

Take this array as an example:

4, 1, 5, 2, 3

Here is the result:

4, 1, 5, 2, 3

Clone this wiki locally