There are several generic sorting algorithms available that are highly optimized and are provided as part of standard programming libraries, such as the qsort implementation of quicksort available through the C standard library. In this work we present a practical algorithmic transformation that uses random sampling and ordered search, that can convert an existing implementation of any sorting ...

We consider the problem of sorting a sequence of n keys in a RAM-like environment where memory faults are possible. An algorithm is said to be δ-resilient if it can tolerate up to δ memory faults during its execution. A resilient sorting algorithm must produce a sequence where every pair of uncorrupted keys is ordered correctly. Finocchi, Grandoni, and Italiano devised a δ-resilient determinist...

1IT University of Copenhagen, Denmark, [email protected] 2Institut für Theoretische Informatik, Technische Universität Ilmenau, Germany, [email protected] 3Institut für Mathematik, Alpen-Adria-Universität Klagenfurt, Austria, [email protected] 4Institut für Mathematik, Alpen-Adria-Universität Klagenfurt, Austria, [email protected] or [email protected] 5Department of Mathe...

Data structures are more easily understood when they are presented visually rather than textually. We have developed a system, Calypso, to allow the visual definition of data structures programs using pictorial pattern/action pairs in an imperative setting. We present several examples including rebalancing an AVL tree and sorting an array using the Quicksort algorithm. These examples demonstrat...

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...

We provide a probabilistic analysis of the output of Quicksort when comparisons can err.

We provide a probabilistic analysis of the output of Quicksort when comparisons can err.