Study of the efficiency of some deterministic preprocessing methods for sorting algorithms

To verify the hypothesis about decrease in time of sorting by algorithms of different computational complexity experiments have been conducted. Several ideas on deterministic preprocessing of data arrays for sorting algorithms have been tested. The following algorithms are proposed: quick preprocess...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	PROBLEMS IN PROGRAMMING 2023-12 (4), p.3-14
Hauptverfasser:	Shynkarenko, V.I., Makarov, O.V.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!