On multikey sorting

A. Fellah, A. Maamir, M. Abaza

Research output: Contribution to journalJournal Articlepeer-review


Few studies of sorting deal with sorting on multikeys. In some applications it is required that the data be sorted on more than one key and in different orders. That is, in ascending on some keys and in descending on some others. In this paper, we propose two different data structures, multikey matrix (MKM) and multikey multilevel linked list (MMLL), and discuss their suitability for multikey sorting. An improved efficiency for multikey sorting is achieved by these data structures. Further, we study their space and time performance and conclude with an algorithm for the distribution of MKM.

Original languageEnglish
Pages (from-to)493-498
Number of pages6
JournalAdvances in engineering software
Issue number7
Publication statusPublished - Jul. 2000


Dive into the research topics of 'On multikey sorting'. Together they form a unique fingerprint.

Cite this