Homogeneous and Non-homogeneous Algorithms

DOI10.1007/978-1-4614-5134-1_17zbMath1375.68182arXiv1008.3546OpenAlexW1500004846MaRDI QIDQ4596168

Ioannis Paparrizos

Publication date: 30 November 2017

Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)

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

zbMATH Keywords

algorithm analysisalgorithm complexityalgorithm classification

Mathematics Subject Classification ID

Analysis of algorithms (68W40) General topics in the theory of algorithms (68W01)

Related Items

Homogeneous and Non-homogeneous Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Best case lower bounds for heapsort
• Precision complexity analysis: A case study using insertion sort
• Weak-heap sort
• Time bounds for selection
• The Analysis of Heapsort
• Homogeneous and Non-homogeneous Algorithms
• On the Best Case of Heapsort
• Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n log n + 0.2 n ) comparisons
• Quicksort