Krassimir Manev
Journal Mathematics and Informatics – Sofia (Bulgaria)
https://doi.org/10.53656/math2024-4-2-ont
Abstract. The difficulty of estimation the time complexity of an algorithm in the worst case is not always the same as the mathematical complexity of the solved task. In this paper we demonstrate a mathematically clear task proposed in a programming contest for Grade 6 students. The task has efficient algorithmic solution but estimation of its time complexity in the worst case is really difficult. We provide corresponding reasoning of the estimated complexity and propose some explanation of it understandable for pupils of that age.
Keywords: programming contests, algorithm, subsequence cutting, time complexity of algorithm
Свързани статии:
An Iterative Algorithm for Determining the Greatest Common Divisor of Two or More Univariate Polynomials
THE IMPACT OF THE ONLINE DISTANCE EDUCATION’S SPECIFICS ON SOME ASPECTS OF THE LEARNING STYLES OF HIGH SCHOOL STUDENTS
History as Wisdom
The Song of Desire (Kāma): If you meet Kāma, don’t kill him
