Alculating the complexity of an algorithm implemented in the C# programming language
https://doi.org/10.21122/2309-4923-2023-4-14-19
Abstract
Time complexity of an algorithm is the number of elementary operations performed by the algorithm. Taking into account the features of programming languages, the authors propose to consider the methodology for calculating this measure of algorithm complexity in the specific language of its implementation, provide formulas for calculating theoretical complexity and the rules for calculating the experimental complexity of program in C#.
About the Authors
I. A. Becker
Belarusian-Russian University
Belarus
Mogilev
Belarus
Mogilev
E. A. Yakimov
Belarusian-Russian University
Belarus
Mogilev
Belarus
Mogilev
N. P. Skrylyov
Belarusian-Russian University
Belarus
Mogilev
Belarus
Mogilev
References
1. Ulyanov, M.V. Resource-efficient computer algorithms. Development and analysis. Moscow: Fizmatlit, 2008, 304 p.
2. Fofanov, O.B. Algorithms and data structures: textbook. Tomsk: Publishing house of Tomsk Polytechnic University, 2014, 126 p.
3. C# documentation: C# operators and expressions [Electronic resource]. Access mode: https://learn.microsoft.com/en-us/dotnet/csharp/language-reference/operators/. – Date of access 08.08.2023.
4. Kreinovich V., Kosheleva O. Among several successful algorithms, simpler ones usually work better: a possible explanation of an empirical observation. Mathematical Structures and Modeling. 2015. N. 1(33). P. 50–55.
5. Mala, F.A. The Big-O of Mathematics and Computer Science. Journal of Applied Mathematics and Computation. 2022. № 6 (1). Pр. 1–3.
6. Licht, B. Obstacles in Learning Algorithm Run-time Complexity Analysis. University of Nebraska at Omaha. 2022. Theses/Capstones/Creative Projects. 193 p.
7. Tsvetkov, V.Ya. Complexity of algorithms of the first kind. Educational Resources and Technologies. 2020. № 4(33). Pр. 73–80.
8. Samuilov, S.V. Methodology of comparative analysis of algorithms by the example of sequential search algorithms. Scientific and methodical electronic journal "Concept". 2014. No. 9. Pр. 46–50.
9. Vybornov A.N., Goloveshkin V.A., Ulyanov M.V. Operational sensitivity of algorithms. Automation and Modern Technologies. 2015. № 8. Pр. 41–46.
10. Rublev V.S., Yusufov M.T. Automated System for Teaching Computational Complexity of Algorithms Course. Modeling and Analysis of Information Systems. 2017. Vol. 24, № 4. Pр. 481–495.
Review
For citations:
Becker I.A., Yakimov E.A., Skrylyov N.P. Alculating the complexity of an algorithm implemented in the C# programming language. «System analysis and applied information science». 2023;(4):14-19. (In Russ.) https://doi.org/10.21122/2309-4923-2023-4-14-19
Views:
388
Email this article 