Hybrid Quicksort: An Empirical Study

Surya Sujarwo

Unduh teks lengkap
(English, 5 pages)


This article describes an empirical study of hybrid approach of quicksort algorithms. The hybrid approach uses various variations of quicksort partition algorithms in combination with cutoff to shellsort using several cutoff elements. The paper compares the running time performance of the existing quicksort partition algorithms with the proposed hybrid approachusing uniqueand duplicate elements. As a result, it is found that several the hybrid approaches performs faster than the existing algorithms for uniqueand duplicate elements.


  • 168 kali dilihat
  • 65 kali diunduh


Communication and Information Technology Journal

Communication and Information Technology Journal (CommIT) focuses on various issues spanning sof... tampilkan semua