an average-case point of view Hsien-Kuei Hwang Bo-Yin Yang Yeong-Nan Yeh...  Home/Search
Context
Related
| sinica.edu.tw/counter.asp?pa...pres.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sinica.edu.tw/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce the concept of presorting algorithms, quantifying and evaluating the performance of such algorithms with the average reduction in number of inversions. Stages of well-known algorithms such as Shellsort and quicksort are evaluated in such a framework and shown to cause a meaning drop in the inversion statistic. The expected value, variance and generating function for the decrease in number of inversions are computed. The possibility of "presorting" a sorting algorithm is also... (Update)
Similar documents (at the sentence level):
58.3%: Presorting Algorithms: An Average-Case Point of View - Hwang, Yang, Yeh (Correct)
Active bibliography (related documents): More All
0.5: A Survey of Adaptive Sorting Algorithms - Estivill-Castro, Wood (1992) (Correct)
0.2: Numerical Representations as Higher-Order Nested Datatypes - Hinze (1998) (Correct)
0.2: B.Tech. Project Report Part II - Project Title Sorting (2002) (Correct)
Similar documents based on text: More All
0.8: Berry-Esseen bounds for the number of maxima in planar regions - Bai (Correct)
0.6: A Heap-Based Optimal Inversions-Sensitive Sorting Algorithm - Sridhar (2003) (Correct)
0.5: Face Recognition Using A Face-Only Database: A New Approach - Liao, Han, Yu, Tyan.. (1998) (Correct)
BibTeX entry: (Update)
@misc{ point-presorting,
author = "An Average-Case Point",
title = "Presorting Algorithms:",
url = "citeseer.ist.psu.edu/581075.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1973
85 Mathematics for the analysis of algorithms (context) - Greene, Knuth - 1981
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
25 Mellin transforms and asymptotics: the mergesort recurrence - Flajolet, Golin - 1994
21 Second edition (context) - Sedgewick - 1988
21 Spearman's footrule as a measure of disarray (context) - Diaconis, Graham - 1977
17 Measures of presortedness and optimal sorting algorithms (context) - Mannila - 1985
7 Asymptotic expansions of mergesort recurrences - Hwang
7 Optimal sampling strategies for quicksort (context) - McGeoch, Tygar - 1995
5 Sorting presorted files (context) - Mehlhorn - 1979
3 Information and Control (context) - Burge, trees et al. - 1958
2 Probability models and statistical analysis for ranking data (context) - Fligner, Verducci - 1993
2 Discrete and Applied Mathematics (context) - Petersson, Mo et al. - 1995
Documents on the same site (http://algo.stat.sinica.edu.tw/): More
Asymptotic Behaviour of Some Infinite Products Involving Prime.. - Hwang (1996) (Correct)
A Constant Arising From the Analysis of Algorithms for Determining .. - Hwang (1996) (Correct)
On the Number of Heaps and the Cost of Heap Construction - Hwang, Steyaert (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC