Can I read Lower Bounds for Comparison Sorts on EtoBox?

Lower Bounds for Comparison Sorts by Elisangela da Silva is a document available to read on EtoBox.

What is Lower Bounds for Comparison Sorts about?

The document discusses lower bounds for comparison-based sorting algorithms. It proves that any comparison-based sorting algorithm requires Ω(n log n) comparisons in the worst case. This establishes a lower bound on the runtime of all comparison sorts. The proof uses a decision tree model where each permutation of inputs corresponds to a leaf. It shows that a tree containing all permutations must have height Ω(n log n).

Author

Elisangela da Silva

Language

EN