Sorting Algorithm Complexity Table

Algo Worst Average Best Selection n² n² n² Insertion n² n² n Heap n log(n) n log(n) n log(n) Bubble n² n² n Cocktail n² n² n² Circle n log (n) log (n) n log (n) n log(n) Merge n log (n) n log(n) n log(n) Quick n² n log(n) n log(n) Shell n² ? n log(n)

A dark table compares the worst-, average-, and best-case time complexities of several sorting algorithms. The joke is the unexplained question mark for Shell sort’s average case, making the otherwise confident reference chart look incomplete and relatable to programmers. It can be sent as a reaction to uncertainty, missing documentation, or pretending to know algorithm analysis.

• @dev_meme / 635 2019-09-03