ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login


Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.4, No. 4)

Publication Date:

Authors : ;

Page : 193-196

Keywords : Sorting; Non Comparative Sort; Sortie data structure; sortie sort; msd radix sort; radix sort;

Source : Downloadexternal Find it from : Google Scholarexternal


Almost all computers regularly sort data. Many different sorting algorithms have been proposed. It is known that no sort algorithm based on key comparisons can sort N keys in less than O (N log N) operations and that many perform O(N2 ) operations in the worst case . This paper is aimed at proposing a new sortie tree data structure, which can be used for the sorting of data. This algorithm that implements a sortie tree data structure is a non-comparative sorting algorithm.

Last modified: 2015-04-21 23:22:50