ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login


Journal: Comtech (Vol.2, No. 2)

Publication Date:

Authors : ;

Page : 849-858

Keywords : algorithm complexity; algorithm efficiency; Brute-force algorithm; asymptotic estimation; big-O notation;

Source : Downloadexternal Find it from : Google Scholarexternal


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.

Last modified: 2015-11-17 15:50:31