Алгоритм гіпершвидкого сортування

М. Б. Тарасюк, В. О. Денисюк · Repository of Vinnytsia National Technical University (Vinnytsia National Technical University) · 2023

A parallel hyperfast sort algorithm is considered, which uses several aggregate elements to divide a list into more than two sublists. This allows the algorithm to sort the list more efficiently in certain cases, especially when the list is already partially sorted or when it has other special properties

Cited by 0 works. Open-access PDF

Authors