ANALISIS KEBUTUHAN WAKTU ALGORITMA INSERTION SORT, MERGE SORT, DAN QUICK SORT DENGAN KOMPLEKSITAS WAKTU

PRATAMA, M. ALLBAR and Desiani, Anita and Irmeilyana, Irmeilyana (2017) ANALISIS KEBUTUHAN WAKTU ALGORITMA INSERTION SORT, MERGE SORT, DAN QUICK SORT DENGAN KOMPLEKSITAS WAKTU. Undergraduate thesis, Sriwijaya University.

	Text RAMA_44201_08121001053.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
Preview	Text RAMA_44201_08121001053_0011127702_0017057403_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (526kB) | Preview
	Text RAMA_44201_08121001053_0011127702_0017057403_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (118kB) | Request a copy
	Text RAMA_44201_08121001053_0011127702_0017057403_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (18kB) | Request a copy
	Text RAMA_44201_08121001053_0011127702_0017057403_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (337kB) | Request a copy
	Text RAMA_44201_08121001053_0011127702_0017057403_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (10kB) | Request a copy
	Text RAMA_44201_08121001053_0011127702_0017057403_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (11kB) | Request a copy
	Text RAMA_44201_08121001053_0011127702_0017057403_07_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (291kB) | Request a copy

Abstract

Sorting is a crucial problem in data processing or database. Data processing will be more simple if the data has been sorted. Sorting problem requires special techniques to make the process of sorting faster. The techniques are named as sorting algorithms. The reliability of an algorithm can be measured by its time complexities. The time complexity T(n) is the number of operations performed in an algorithm for N data input. One of time complexities is Big-O or worst case. The Worst case (Big- O) is a time complexities for the worst condition of an algorithm. This study will analyze the time complexity of the algorithms Insertion Sort, Merge Sort and Insertion Sort based on their Big-O (worst case). Each algorithm will be calculated its complexity time in two ways. The first is calculated based on their steps in sorting process and the second is calculated based on their coding and running program using C++. The time complexity of Merge Sort is O(n log n) and time complexity of Quick Sort and Insertion Sort is O(n2), it means the time complexity of Merge Sort is less and faster for large N data input than Quick Sort and Insertion Sort. Otherwise Insertion Sort is faster for small N data input than Merge Sort and Quick Sort. Quick sort needs much time to sort data not only for small N data input but also for large N data input. It means Quick Sort doesn’t work well in worst case.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Sorting, Insertion Sort, Quick Sort, Merge Sort, Time Complexity, Worst Case, Big-O
Subjects:	Q Science > QA Mathematics > QA150-272.5 Algebra > QA169.A65 Categories (Mathematics)--Periodicals. Algebra--Periodicals. Mathematical analysis--Periodicals. Topology--Periodicals. Computer science--Periodicals Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Dies Meirita Sari
Date Deposited:	05 Dec 2019 05:27
Last Modified:	05 Dec 2019 05:27
URI:	http://repository.unsri.ac.id/id/eprint/20119

Actions (login required)

View Item