HYBRID QUICKSORT: AN EMPIRICAL STUDY

HYBRID QUICKSORT: AN EMPIRICAL STUDY

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 q...

Full description

Bibliographic Details
Main Author: Surya Sujarwo
Format: Article
Language:English
Published: Bina Nusantara University 2013-10-01
Series:CommIT Journal
Online Access:https://journal.binus.ac.id/index.php/commit/article/view/582
id doaj-8d25ca602e5e45c2aa0dd48a1625a24f
record_format Article
spelling doaj-8d25ca602e5e45c2aa0dd48a1625a24f2020-11-25T00:10:12ZengBina Nusantara UniversityCommIT Journal1979-24842460-70102013-10-0172414510.21512/commit.v7i2.582570HYBRID QUICKSORT: AN EMPIRICAL STUDYSurya Sujarwo0School of Computer Science, Bina Nusantara University Jln. K. H. Syahdan No. 9, Jakarta 11480, IndonesiaThis 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.https://journal.binus.ac.id/index.php/commit/article/view/582
collection DOAJ
language English
format Article
sources DOAJ
author Surya Sujarwo
spellingShingle Surya Sujarwo
HYBRID QUICKSORT: AN EMPIRICAL STUDY
CommIT Journal
author_facet Surya Sujarwo
author_sort Surya Sujarwo
title HYBRID QUICKSORT: AN EMPIRICAL STUDY
title_short HYBRID QUICKSORT: AN EMPIRICAL STUDY
title_full HYBRID QUICKSORT: AN EMPIRICAL STUDY
title_fullStr HYBRID QUICKSORT: AN EMPIRICAL STUDY
title_full_unstemmed HYBRID QUICKSORT: AN EMPIRICAL STUDY
title_sort hybrid quicksort: an empirical study
publisher Bina Nusantara University
series CommIT Journal
issn 1979-2484
2460-7010
publishDate 2013-10-01
description 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.
url https://journal.binus.ac.id/index.php/commit/article/view/582
work_keys_str_mv AT suryasujarwo hybridquicksortanempiricalstudy
_version_ 1725408731995308032

Similar Items