The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs

Details The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs

2012-04-23

arxiv.org/abs/1204.5023v1

Computer Science

Data Structures and Algorithms

Scientific paper

The present paper makes a study on Partition sort algorithm for negative binomial inputs. Comparing the results with those for binomial inputs in our previous work, we find that this algorithm is sensitive to parameters of both distributions. But the main effects as well as the interaction effects involving these parameters and the input size are more significant for negative binomial case.

Affiliated with

Also associated with

No associations

Rating

The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs 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 The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-443792