PRATAMA, M. ALLBAR and Desiani, Anita and Irmeilyana, Irmeilyana Analisis Kebutuhan Waktu Algoritma Insertion Sort, Merge Sort, dan Quick Sort dengan Kompleksitas Waktu (Peer Review). Fasilkom Unsri, Palembang.
Preview |
Text
15.1,98-bambang.pdf Download (459kB) | Preview |
Preview |
Text
15.2-putra.pdf Download (469kB) | Preview |
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 Keyword: Sorting, Insertion Sort, Quick Sort, Merge Sort,
| Item Type: | Other |
|---|---|
| Uncontrolled Keywords: | Sorting, Insertion Sort, Quick Sort, Merge Sort, Time Complexity, Worst Case, Big-O |
| Subjects: | |
| Divisions: | 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1) |
| Depositing User: | Mrs Irmeiliana Irmeiliana |
| Date Deposited: | 01 Jan 2020 09:07 |
| Last Modified: | 01 Jan 2020 09:07 |
| URI: | http://repository.unsri.ac.id/id/eprint/22754 |
Actions (login required)
 |
View Item |