Efisiensi Algoritma dan Notasi O-Besar
DOI:
https://doi.org/10.21512/comtech.v2i2.2835Keywords:
algorithm complexity, algorithm efficiency, Brute-force algorithm, asymptotic estimation, big-O notationAbstract
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.
Plum Analytics
References
Arora, S. and Barak, B. (2009). Computational Complexity: A Modern Approach. New York: Cambridge University Press.
Dave, P. H. and Dave, H. B. (2007). Design and Analysis of Algorithms: Efficiency of Algorithms, 371 – 404. Delhi: Pearson Education India.
Goldreich, Oded. (2008). Computational Complexity: A Conceptual Perspective. New York: Cambridge University Press.
Greene, D. A. & Knuth, D. E. (1982). Mathematics for the Analysis of Algorithms (2nd ed.). Boston: Birkhäuser.
Higham, N. J. (1998). Handbook of Writing for the Mathematical Sciences, (2nd ed.). Philadelphia: SIAM.
Knuth, D. E. (1976). Big Omicron and big Omega and big Theta. ACM SIGACT News, 8 (2).
Knuth, D. E. (1998). Teach Calculus with Big O. Notices of the American Mathematical Society, 45 (6), 687. Diakses dari http://www.ams.org/notices/199806/commentary.pdf.
Knuth, D. E. (1999). The Art of Computer Programming, (3rd ed.). Boston: Addison-Wesley.
Sedgewick, R. (1998). Algorithms in C, Parts 1-4. Fundamentals, Data Structures, Sorting, Searching, (3rd ed.). Boston: Addison-Wesley.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
USER RIGHTS
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows:
