SHS Web Conf.
Volume 75, 2020The International Conference on History, Theory and Methodology of Learning (ICHTML 2020)
|Number of page(s)||6|
|Section||Methodology of Learning, Education and Training|
|Published online||26 March 2020|
Reduction of programs execution time for tasks related to sequences or matrices
1 Uzhhorod National University Uzhhorod, Uzhhorod
2 T.H. Shevchenko National University “Chernihiv Colehium”, Chernihiv, Ukraine
* Corresponding author: firstname.lastname@example.org
The article discusses three approaches to reducing runtime of the programs, which are solutions of Olympiad tasks on computer science, related to sequences or matrices. The first approach is based on the representation of some sequences in matrix form and then the program of calculating the members of the sequence will have asymptotics equal to the time complexity of the exponentiation algorithm and will be O(log (n)). The second approach is to upgrade the known code to obtain significant reduction of the program runtime. This approach is very important to know for scientists who write code for scientific researches and are faced with matrix multiplication operations. The third approach is based on reducing time complexity by search for regularities; the author's task is presented and this approach is used to solve it.
© The Authors, published by EDP Sciences, 2020
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.