Computing inversion pair cardinality through partition-based sorting

DOI10.1007/s00607-008-0011-xzbMath1158.68004OpenAlexW2150413965MaRDI QIDQ956693

B. E. Eshmatov

Publication date: 25 November 2008

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-008-0011-x

zbMATH Keywords

randomized algorithmadaptiveinversion pairsmeasures of disorderpartition-based sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Randomized algorithms (68W20)

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal Sampling Strategies in Quicksort and Quickselect
• Measures of Presortedness and Optimal Sorting Algorithms
• Sorting, trees, and measures of order
• Design and Analysis of a Data Structure for Representing Sorted Lists
• A new approach to dynamic all pairs shortest paths
• Quicksort
• Fault-tolerant real-time scheduling

This page was built for publication: Computing inversion pair cardinality through partition-based sorting