A framework for adaptive sorting

Discrete Applied Mathematics

Volumn 59, Issue 2, 1995, Pages 153-179

  Petersson, Ola ^a   Moffat, Alistair ^b  

^a LUND UNIVERSITY   (Sweden)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Measures; Partial order; Presortedness; Sorting

Indexed keywords

EID: 0039594102     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(93)E0160-Z     Document Type: Article

References (22)

1. On partitions of permutations into increasing and decreasing subsequences
2. Sorting, trees, and measures of order
3. Sublinear merging and Natural Mergesort
4. Best sorting algorithms for nearly sorted lists
5. Spearman's footrule as a measure of disarray
6. Smoothsort, an alternative to sorting in situ
7. Exploiting partial order with Quicksort
8. A new measure of presortedness
9. How good is the information theory bound in sorting?
10. A new representation of linear lists
11. Local Insertion Sort revisited
12. Adaptive Heapsort
13. Sorting shuffled monotone sequences
14. Splitsort-an adaptive sorting algorithm
15. Instance complexity for sorting and NP-complete problems
16. Measures of presortedness and optimal sorting algorithms
17. Sorting presorted files
18. Historical searching
19. Adaptive sorting
20. Encroaching lists as a measure of presortedness