Coping with Erroneous Information While Sorting
IEEE Transactions on Computers
On sorting in the presence of erroneous information
Information Processing Letters
A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Sorting and measures of disorder
Sorting and measures of disorder
Right invariant metrics and measures of presortedness
Discrete Applied Mathematics
Breaking the &thgr;(nlog2n) barrier for sorting with faults
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
SIAM Journal on Computing
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Searching games with errors---fifty years of coping with liars
Theoretical Computer Science
A Fault-Tolerant Merge Sorting Algorithm
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Quicksort with Unreliable Comparisons: A Probabilistic Analysis
Combinatorics, Probability and Computing
Sorting and Searching in Faulty Memories
Algorithmica
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science
Measures of Presortedness and Optimal Sorting Algorithms
IEEE Transactions on Computers
Designing reliable algorithms in unreliable memories
Computer Science Review
| Hi-index | 0.04 |
In this paper, we analyze the recursive merge sort algorithm and quantify the deviation of the output from the correct sorted order if the outcomes of one or more comparisons are in error. The disorder in the output sequence is quantified by four measures: the number of runs, the smallest number of integers that need to be removed to leave the sequence sorted, the number of inversions, and the smallest number of successive exchanges needed to sort the sequence. For input sequences whose length is large compared to the number of errors, a comparison is made between the robustness to errors of bubble sort, straight insertion sort, and recursive merge sort.