KAJIAN ALGORITMA MODUL PENCETAKAN PEMBIMBING AKADEMIK JURUSAN ILMU KOMPUTER

Choiranti Efrina, 1017032021 (2015) KAJIAN ALGORITMA MODUL PENCETAKAN PEMBIMBING AKADEMIK JURUSAN ILMU KOMPUTER. Fakultas Matematika dan Ilmu Pengetahuan Alam, UNIVERSITAS LAMPUNG.

[img]
Preview
Text
1. COVER LUAR.pdf

Download (35Kb) | Preview
[img]
Preview
Text
2. ABSTRACK.pdf

Download (107Kb) | Preview
[img]
Preview
Text
3. ABSTRAK.pdf

Download (109Kb) | Preview
[img]
Preview
Text
4. COVER DALAM.pdf

Download (35Kb) | Preview
[img]
Preview
Text
5. LEMBAR PERSETUJUAN.pdf

Download (143Kb) | Preview
[img]
Preview
Text
6. LEMBAR PENGESAHAN.pdf

Download (137Kb) | Preview
[img]
Preview
Text
7. LEMBAR PERNYATAAN.pdf

Download (138Kb) | Preview
[img]
Preview
Text
8. RIWAYAT HIDUP.pdf

Download (51Kb) | Preview
[img]
Preview
Text
9. MOTO.pdf

Download (128Kb) | Preview
[img]
Preview
Text
10. SANWACANA.pdf

Download (200Kb) | Preview
[img]
Preview
Text
11. DAFTAR ISI.pdf

Download (15Kb) | Preview
[img]
Preview
Text
12. DAFTAR GAMBAR.pdf

Download (10Kb) | Preview
[img]
Preview
Text
13. DAFTAR TABEL.pdf

Download (6Kb) | Preview
[img]
Preview
Text
BAB 1.pdf

Download (577Kb) | Preview
[img]
Preview
Text
BAB 2.pdf

Download (4Mb) | Preview
[img]
Preview
Text
BAB 3.pdf

Download (337Kb) | Preview
[img] Text
BAB 4.pdf
Restricted to Registered users only

Download (15Mb)
[img]
Preview
Text
BAB 5.pdf

Download (6Kb) | Preview
[img]
Preview
Text
DAFTAR PUSTAKA.pdf

Download (80Kb) | Preview

Abstrak

ABSTRACT The list of academic advisor utility is an utility that was developed to help the administration process of computer science major. Previously, it's only used bubble sort sorting algorithm. We try to compare the bubble sort algorithm with selection sort and quick sort to determine the quickest algorithm by searching the worst case (slowest execution time per unit) and best case (fastest execution time per unit). The result is quick < selection < bubble. Selection sort algorithm is proven to be the quickest when n < 26. But the cademic advisor data that are used in the utility is more than 26. So in this research, the quicksort algorithm is the fastest algorithm. ABSTRAK Utility Daftar Pembimbing Akademik dibangun untuk membantu proses administrasi di Jurusan Ilmu Komputer, ketika sebelumnya dibuat menggunakan algortima sorting Bubble Sort. Kajian sorting pada Utility ini diberi pembanding yang berupa selection sort dan quick sort untuk mendapatkan sorting manakah yang paling cepat dengan mencari Worst Case (waktu terlambat program tereksekusi persatuan unit) dan Best Case (waktu tercepat program tereksekusi persatuan unit) . Hasil dari penelitian ini yaitu, Quick < Selecton < Bubble. Algoritma selection memberikan pembuktian bahwa ketika n<26 maka selection lebih cepat dari yang lain, namun data pembimbing akademik pada Utility ini dipastikan lebih dari jumlah tersebut (26). Oleh karena itu, quick sort menempati algortima sorting yang paling cepat. Kata kunci : Bubble Sort, Selection Sort, Quick Sort, Worst Case, Best Case

Tipe Karya Ilmiah: Skripsi
Subyek: Q Science (General) > QA Mathematics > QA76 Computer software
Program Studi: Fakultas MIPA > Prodi Ilmu Komputer
Depositing User: 1855853 . Digilib
Date Deposited: 03 Jul 2015 06:20
Last Modified: 03 Jul 2015 06:20
URI: http://digilib.unila.ac.id/id/eprint/10833

Actions (login required)

View Item View Item