Decision Sort and its Parallel Implementation

Details Decision Sort and its Parallel Implementation Decision Sort and its Parallel Implementation

2005-05-24

arxiv.org/abs/cs/0505066v1

Computer Science

Data Structures and Algorithms

5 pages, 3 tables, 1 figure, National Conference on Bioinformatics Computing'05

Scientific paper

In this paper, a sorting technique is presented that takes as input a data set whose primary key domain is known to the sorting algorithm, and works with an time efficiency of O(n+k), where k is the primary key domain. It is shown that the algorithm has applicability over a wide range of data sets. Later, a parallel formulation of the same is proposed and its effectiveness is argued. Though this algorithm is applicable over a wide range of general data sets, it finds special application (much superior to others) in places where sorting information that arrives in parts and in cases where input data is huge in size.

Affiliated with

Also associated with

No associations

Rating

Decision Sort and its Parallel Implementation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decision Sort and its Parallel Implementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decision Sort and its Parallel Implementation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72658