Probabilistic analysis of algorithms for the Dutch national flag problem

Authors:
Wei-Mei Chen
Affiliations:
Department of Applied Mathematics, Tatung University, Taipei, Taiwan
Venue:
Theoretical Computer Science
Year:
2005

Citing 11
Cited 0

Algorithms in C

Algorithms in C
Engineering a sort function

Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
On convergence rates in the central limit theorems for combinatorial structures

European Journal of Combinatorics
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An analysis of algorithms for the Dutch National Flag Problem

Communications of the ACM
Algorithm 65: find

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
The Elements of Programming Style

The Elements of Programming Style
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

SIAM Journal on Computing
A flexible environment for program development based on a symbolic interpreter

ICSE '79 Proceedings of the 4th international conference on Software engineering

Quantified Score

Hi-index	5.23

Visualization

Abstract

A detailed probabilistic analysis is given of algorithms for the Dutch national flag problem. We derive central and local limit theorems for the cost, as well as probabilities of large deviations. Performance of a related algorithm is also studied.