COMPARING SEARCHING AND SORTING ALGORITHMS EFFICIENCY IN IMPLEMENTING COMPUTATIONAL EXPERIMENT IN PROGRAMMING ENVIRONMENT
Keywords:
computational experiment, sorting algorithms, results statistical processing unit
Abstract
This article considers different aspects which allow defining correctness of choosing sorting algorithms. Also some algorithms, needed for computational experiments for certain class of programs, are compared.
Downloads
Download data is not yet available.
Metrics
Metrics Loading ...
References
1. Lavinskij G. V., Petrenko P.A.., Semenov N.P. Problemy ocenki slozhnosti algoritmov i vychislenij pri proektirovanii upravljajushhix sistem // USiM – 1997. – № 2. – S. 6-13.
2. Traxtenbrot B. A. Slozhnost' algoritmov i vychislenij. – Novosibirsk: NGU, 1967. – 211 s. 1970.
3. Xartmanis Dzh., Xopkroft Dzh. E. Obzor teorii slozhnosti vychislenij // Kiberneticheskij sbornik – 1974. – № 11.
Published
2011-11-24
Pages
164-167
How to Cite
SaganR. (2011). COMPARING SEARCHING AND SORTING ALGORITHMS EFFICIENCY IN IMPLEMENTING COMPUTATIONAL EXPERIMENT IN PROGRAMMING ENVIRONMENT. Journal of Information Technologies in Education (ITE), (10), 164-167. https://doi.org/10.14308/ite000282
Section
Articles
