Tight Bounds for Online Stable Sorting

Details Tight Bounds for Online Stable Sorting Tight Bounds for Online Stable Sorting

2009-07-04

arxiv.org/abs/0907.0741v1

Computer Science

Data Structures and Algorithms

Scientific paper

Although many authors have considered how many ternary comparisons it takes to sort a multiset $S$ of size $n$, the best known upper and lower bounds still differ by a term linear in $n$. In this paper we restrict our attention to online stable sorting and prove upper and lower bounds that are within (o (n)) not only of each other but also of the best known upper bound for offline sorting. Specifically, we first prove that if the number of distinct elements (\sigma = o (n / \log n)), then ((H + 1) n + o (n)) comparisons are sufficient, where $H$ is the entropy of the distribution of the elements in $S$. We then give a simple proof that ((H + 1) n - o (n)) comparisons are necessary in the worst case.

Affiliated with

Also associated with

No associations

Rating

Tight Bounds for Online Stable Sorting 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 Tight Bounds for Online Stable Sorting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight Bounds for Online Stable Sorting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-529917