Chapter

Experimental and Efficient Algorithms

Volume 3503 of the series Lecture Notes in Computer Science pp 597-601

An Empirical Study for Inversions-Sensitive Sorting Algorithms

  • Amr ElmasryAffiliated withDept of Computer Engineering and Systems, Alexandria UniversityFaculty of Science and Information Technology, Al-Zaytoonah University
  • , Abdelrahman HammadAffiliated withDept of Computer Engineering and Systems, Alexandria University

* Final gross prices may vary according to local VAT.

Get Access

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.