Open AccessEfisiensi Algoritma dan Notasi O-Besar
Author(s) -
Subandijo Subandijo
Publication year - 2011
Publication title -
comtech/comtech
Language(s) - English
Resource type - Journals
eISSN - 2476-907X
pISSN - 2087-1244
DOI - 10.21512/comtech.v2i2.2835
Subject(s) - notation , computer science , computational complexity theory , function (biology) , algorithm , implementation , time complexity , brute force , efficient algorithm , mathematics , arithmetic , computer security , evolutionary biology , biology , programming language
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 estimaties are used because different implementations of the same algorithm may differ in efficiency. The big-O notation is used to generate the estimation.