aaaa

a

Hybrid Sorting Method

 

Greek

A Study of Comparison Merge Sort Algorithm and Non-Comparison Counting Sort Algorithm in order to Combine them into a New, more Efficient Algorithm.

Theoretical Model, Application in Color Quantization and Test Data.

by Angelos Spartalis
Mechanical Engineer N.T.U.A.
angelosspartalis@yahoo.gr

DECEMBER 2015

The performance of Merge sort algorithm (gray thick line) and Counting sort algorithm (colored thin lines) while sorting random natural numbers. Click image to zoom in. See also memory consumption chart here and test data file here.

The performance of Hybrid method, combining Merge sort and Counting sort algorithms, while sorting random natural numbers. Click image to zoom in. See also memory consumption chart here and test data file here.

download the Paper
visit  www.academia.ecu  or click here

download  SPARTA_sort.zip

Includes the software used for the tests of the study
in the form of executable files and open source code.
Also includes the charts and the images of the study.

chart 6

During 4K image color quantization of 24 bit to 8 bit, Merge sort is sorting within the red area, Counting sort within the yellow area and Hybrid method within the blue border, performing 161% faster than Merge sort and 15% faster than Counting sort. All 3 algorithms consume the same amount of temporary memory (64 MB). See also test data here.