EFISIENSI ALGORITMA DAN NOTASI O-BESAR
Journal: Comtech (Vol.2, No. 2)Publication Date: 2011-12-29
Authors : Subandijo;
Page : 849-858
Keywords : algorithm complexity; algorithm efficiency; Brute-force algorithm; asymptotic estimation; big-O notation;
Abstract
Efficiency or the running time of an algorithm is usually calculated with time complexity or space complexity as a function of various inputs. It is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. Brute-force algorithm is the easiest way to calculate the performance of the algorithm. However, it is not recommended since it does not sufficiently explain the efficiency of the algorithm. Asymptotic estimates are used because different implementations of the same algorithm may differ in efficiency. The big-O notation is used to generate the estimation.
Other Latest Articles
- EVALUASI DAYA GABUNG PERSILANGAN JAGUNG DENGAN METODE DIALLEL
- STOCHASTIC BUS DISPATCHING MODEL UNTUK OPTIMALISASI JUMLAH BUS TRANSJAKARTA KORIDOR 3
- PENERAPAN SISTEM INFORMASI GEOGRAFI PADA TRAFFIC MANAGEMENT CENTER
- PARADIGMA BAHASA PEMROGRAMAN
- ANALISIS RESPONS DINAMIK PELAT LANTAI BANGUNAN ORTOTROPIK DENGAN DUA PENGAKU YANG DIBERI BEBAN LEDAKAN
Last modified: 2015-11-17 15:50:31