3055	 An Analysis of Algorithms for the Dutch National Flag Problem	 Solutions to the Dutch National Flag Problem have been given by Dijkstra and Meyer . 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 N and that these values differ at most by of a swap and asymptotically by of a swap. The algorithm of Meyer is shown to have expected swap complexity N. Algorithmic analysis Dutch National Flag Problem refinement structured programming
