Using nonlinear difference equations to study Quicksort algorithms

DOI10.1080/10236198.2020.1720665zbMath1433.68113arXiv1905.00118OpenAlexW3006375390MaRDI QIDQ4960142

Yukun Yao

Publication date: 9 April 2020

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.00118

zbMATH Keywords

recurrence relationdifference equationexplicit expressionQuicksortexperimental mathematics

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Searching and sorting (68P10) Combinatorics in computer science (68R05) Applications of difference equations (39A60)

Uses Software

• SIGMA
• HISTABRUT
• EKHAD
• SMCper
• Quicksort
• stCore

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• A holonomic systems approach to special functions identities
• Analysis of multiple quickselect variants.
• Asymptotic analysis of an optimized quicksort algorithm.
• Symbolic moment calculus. I: Foundations and permutation pattern statistics
• Symbolic summation assists combinatorics
• Analysis of Hoare's FIND algorithm with Median-of-three partition
• DUAL PIVOT QUICKSORT
• Combinatorial analysis of quicksort algorithm
• A note concerning the limit distribution of the quicksort algorithm
• Quicksort

This page was built for publication: Using nonlinear difference equations to study Quicksort algorithms