An Empirical Study for Inversions-Sensitive Sorting Algorithms

  • Amr Elmasry
  • Abdelrahman Hammad
Conference paper

DOI: 10.1007/11427186_52

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)
Cite this paper as:
Elmasry A., Hammad A. (2005) An Empirical Study for Inversions-Sensitive Sorting Algorithms. In: Nikoletseas S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg

Abstract

We study the performance of the most practical internal adaptive sorting algorithms. Experimental results show that adaptive AVL sort performs the least number of comparisons unless the number of inversions is fewer than 1%. In such case, Splaysort performs the fewest number of comparisons. On the other hand, the running time of Quicksort is superior unless the number of inversions is fewer than 1.5%. In such case, Splaysort consumes the smallest running time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Amr Elmasry
    • 1
    • 2
  • Abdelrahman Hammad
    • 1
  1. 1.Dept of Computer Engineering and SystemsAlexandria UniversityEgypt
  2. 2.Faculty of Science and Information TechnologyAl-Zaytoonah UniversityJordan

Personalised recommendations