Kompleksitas Algoritma Quick Sort Guna Menemukan Efisiensi Waktu Dan Memori

  • Wahju Tjahjo Saputro Universitas Muhammadiyah Purworejo
Keywords: Quicksort, Divide and conquer, Performance, Memory

Abstract

Many algorithm methods slve a problem many research have done various performance of each algorithm, until now has growth rapidly the performance of algorithms in the field of computer science. One of the methods from all of algorithms is used such as the quick sort algorithm.
Qucik Sort Algorithm in the process of sorting data used divide and conquer techniques. Divide and conquer techniques can be determined right left or middle pivot. So they have 3 performance such as base case O(n2 log n), worst case O(n2) and average case Tavg = O(n2 log n). In certain, case the worst case was able to work well in place and in virtual memory.

Author Biography

Wahju Tjahjo Saputro, Universitas Muhammadiyah Purworejo

Academic profile: Scholar | Sinta | Orcid ID 

References

Cormane, T., & dkk. (2001). Introduction to Algorithm. Massachusetts, England: The MIT Cambridge Press

Lafore, R. (1999). Teach Your Self Data Structure and Algorithmin 24 Hours. Indianapolis, USA: Sams Publishing

Purbasari, I. (2007). Desain dan Analisis Algoritma. Yogyakarta, DIY, Indonesia: Graha Ilmu

Rinaldi, M. (2011). Diktat Kuliah Analisis Algoritma. Bandung: STT-Telkom

Syaukani, M. (2011). Algoritma dengan C C++ dan JAVA. Bogor: Mitra Wacana Media

Syaukani, M. (2011). Struktur Data dengan C dan C++. Bogor, Jawa Barat, Indonesia: Mitra Wacana Indonesia

Published
2018-05-29
How to Cite
Saputro, W. T. (2018). Kompleksitas Algoritma Quick Sort Guna Menemukan Efisiensi Waktu Dan Memori. INTEK : Jurnal Informatika Dan Teknologi Informasi, 1(1), 1-6. https://doi.org/10.37729/intek.v1i1.96
Section
Articles

Most read articles by the same author(s)

<< < 1 2