Hornyák, Olivér (2022) An approach to classify algorithms by complexity. PRODUCTION SYSTEMS AND INFORMATION ENGINEERING, 10 (3). pp. 98-104. ISSN 1785-1270
|
Text
1973-Article Text-9029-1-10-20230619.pdf - Published Version Download (471kB) | Preview |
Official URL: https://doi.org/10.32968/psaie.2022.3.8
Abstract
Computers run programs that are representations of an algorithm. Computational complexity refers to measures to evaluate the efficiency of algorithms. Two resource types are investigated typically: time and space complexities. Time complexity is defined as the amount of time of time requires to execute each statement of the algorithm.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | algorithm, complexity |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA76 Computer software / programozás |
| Depositing User: | Anita Agárdi |
| Date Deposited: | 26 Nov 2024 11:48 |
| Last Modified: | 26 Nov 2024 11:48 |
| URI: | https://real.mtak.hu/id/eprint/210298 |
Actions (login required)
 |
Edit Item |
