Efisiensi Algoritma dan Notasi O-Besar
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 algorit...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Bina Nusantara University
2011-12-01
|
| Series: | ComTech |
| Subjects: | |
| Online Access: | https://journal.binus.ac.id/index.php/comtech/article/view/2835 |