Sieve sorting algorithm
Тип публікації :
Стаття
Дата випуску :
2018
Автор(и) :
Koval, Iu. V.
Krak, Iu. V.
Мова основного тексту :
Англійська
eKNUTSHIR URL :
Випуск :
4
ISSN :
1812-5409
Початкова сторінка :
92
Кінцева сторінка :
95
Цитування :
[APA 7] Koval, I. V., & Krak, I. V. (2018). Sieve sorting algorithm. Bulletin of Taras Shevchenko National University of Kyiv. Physics and Mathematics, (4), 92–95. https://doi.org/10.17721/1812-5409.2018/4.13
[ДСТУ] Koval I. V., Krak I. V. Sieve sorting algorithm. Bulletin of Taras Shevchenko National University of Kyiv. Physics and Mathematics. 2018. no. 4. P. 92—95. DOI: 10.17721/1812-5409.2018/4.13 (date of access: 18.07.2026).
The purpose of this paper is to present a sorting algorithm that allows parallel execution of comparison operations, analysing complexity and runtime of the algorithm, discussing about a virtual process for this algorithm, and the implementation of the C++ program that simulates such a virtual process. The following problems were solved in this paper: the algorithm of sieve sorting was proposed, the correctness of its execution were proved, the complexity and timing of this algorithm were investigated, the structure of the virtual process implementing this algorithm was proposed, the C ++ program that simulates such a virtual process was discussed. Program code may be taken from the authors. The improvement for the algorithm also provided and correctness of such improvement proved. In the process of problem solving the inconvenience of classical UNIX-like implementation for working with the mechanisms of piping and the processes creating was found out.Key words: sieve sorting, virtual process.Pages of the article in the issue: 92 - 95Language of the article: English
Файл(и) :![Ескіз]()
Вантажиться...
Формат :
Adobe PDF
Розмір :
272.95 KB
Контрольна сума :
(MD5):4a1db0f8f96e1a5f903f7edaee3bfffb
Якщо не вказано інше, ця робота розповсюджується на умовах ліцензії Creative Commons Attribution 4.0 International