On the basis of literary sources analysis the article concludes that each of the common methods for algorithms development (brute force, reduction of the task size, decomposition, transformation, greedy algorithms, dynamic programming, an iterative improvement, backtracking, branch-and-bound method, local search) is suitable to complete a range of mathematical tasks. The authors have proposed methods for algorithms development to complete the tasks of finding the greatest common divisor and the factorial number. Based on the selected Python mathematical possibilities the article analyzes the effectiveness of the proposed methods through the use of modules profile and time and method timeit of language Python.
methods for algorithms development, efficiency analysis, Python
"Analiz metodiv rozrobky alhorytmiv rozviazannia matematychnykh zadach zasobamy movy Python" [Analysis of methods for algorithms development to complete mathematical tasks by language Pytho],
Information Processing Systems,