Work

Research on the Amount of Information Needed to Restore the Original Order of Four or Eight Elements Lists, when Using Different Sorting Algorithms

Year: 2024

Type: article

Abstract: Data sorting is essential in most software applications, but sometimes elements need to be restored to their original order after processing. If this restoration happens long after sorting or on a different computer, additional information is needed to restore the order. This work explores the information needed to restore sequences of 4 and 8 elements. The following sorting algorithms were studied: parallel neighbour (odd even) sort, insertion sort, bubble sort, shell sort, merge-insertion sort, and merge sort. For each algorithm, the amount of information required in bytes to restore the original order of the elements was determined.

Source: Proceedings of the Bulgarian Academy of Sciences

DOI: 10.7546/crabs.2024.09.07

Authors: Metodi Dimitrov, Tzvetomir Vassilev

Institution: Angel Kanchev University of Ruse

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: European Commission

Award: G1562245063