INTEK: Informatika dan Teknologi Informasi
Vol. 1 No. 1 (2018)

Kompleksitas Algoritma Quick Sort Guna Menemukan Efisiensi Waktu Dan Memori

Wahju Tjahjo Saputro (Universitas Muhammadiyah Purworejo)

Article Info

Publish Date
29 May 2018

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.

Copyrights © 2018




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
INTEK: Informatika dan Teknologi Informasi
Website

Abbrev

intek

Publisher

Universitas Muhammadiyah Purworejo

Subject

Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Engineering Other

Description

Focus and Scopes INTEK Jurnal Informatika dan Teknologi Informasi (INTEK) is a peer-reviewed Journal of Information and Computer Sciences published by Universitas Muhammadiyah Purworejo. This journal publishes two times a year (May and November). INTEK is a media for researchers, academics, and ...