The Novel Multi-Layered Approach to Enhance the Sorting Performance of Healthcare Analysis

Limitations Of An Existing Approach

With general radix sort approach, the problem is that algorithm must examine every element of every item being sorted. On the other hand, comparison-based sorts techniques skip a fair number of sub-elements (digits, characters, etc.). Non-comparison based sorting algorithms make assumptions about the input. To ensure linear time complexity input elements are expected within a range of constant length whereas in comparison based methods no such assumption about the input is desired. Moreover, non-comparison based methods adds extra memory cost and lacking in generality of the input. Other behavior of comparison-based method is that they need to call a comparator on input elements a whole bunch of times and this makes them inherently slower.

It is needless to remind that, in information technology science, sorting algorithms are considered to be one of the essential and most used techniques that puts elements of a list in certain correct order. There is various methods and types are available to apply them in different kind of situations. As an example, we can consider Comparison and Non- Comparison types of sorting. Particularly, if we take a look at Non-Comparison sorting, we can release that there are different types of techniques available to use, such as Counting sort, Bucket Sort, Radix Sort and etc.

Figure 1.

Bucket sort example