scientific article

zbMATH Open0677.68023MaRDI QIDQ3833605

No author found.

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

primitive operationsgeneral lower boundCost measurescost of a sorting algorithm

Mathematics Subject Classification ID

Partial orders, general (06A06) Searching and sorting (68P10) Algorithms in computer science (68W99)

Related Items (2)

Sorting with forbidden intermediates ⋮ The recursive structure of some ordering problems

Recommendations

• Unnamed Item 👍 👎
• Sorting can exponentially speed up pure dynamic programming 👍 👎
• Sorting permutations by limited-size operations 👍 👎
• Very Fast Non-dominated Sorting 👍 👎
• Sorting with expensive comparands 👍 👎
• Fast Sorting and Pattern-Avoiding Permutations 👍 👎
• Sorting n objects with a k-sorter 👍 👎
• Fast and Robust Vectorized In-Place Sorting of Primitive Types 👍 👎

This page was built for publication: