Surya Sujarwo
School of Computer Science, Bina Nusantara University Jln. K. H. Syahdan No. 9, Jakarta 11480, Indonesia

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

HYBRID QUICKSORT: AN EMPIRICAL STUDY Surya Sujarwo
CommIT (Communication and Information Technology) Journal Vol. 7 No. 2 (2013): CommIT Journal
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/commit.v7i2.582

Abstract

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.