An analysis of algorithms for the Dutch National Flag Problem

Authors:
Colin L. McMaster
Affiliations:
Univ. of California, Berkeley
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 4

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Discipline of Programming

A Discipline of Programming

On the proof of correctness of a calendar program

Communications of the ACM
A flexible environment for program development based on a symbolic interpreter

ICSE '79 Proceedings of the 4th international conference on Software engineering
Probabilistic analysis of algorithms for the Dutch national flag problem

Theoretical Computer Science
Programming with angelic nondeterminism

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	48.24

Visualization

Abstract

Solutions to the Dutch National Flag Problem have been given by Dijkstra [1] and Meyer [3]. Dijkstra starts with a simple program and arrives at an improved program by refinement. Both of the algorithms given by Dijkstra are shown to have an expected number of swaps which is 2/3N + &thgr;(1) and that these values differ at most by 1/3 of a swap and asymptotically by 1/4 of a swap. The algorithm of Meyer is shown to have expected swap complexity 5/9 N.