Sometimes simple implementations of one data structure or the other have disadvantages that can be overcome by better design.

The simplest possible implementation would be a straight mapping.

However, this principle turned out to be an exercise in interpretation, rather than the simple implementation of a new model of succession.

It has an exceptionally simple implementation for a full wave solver.

It is supposed to be a very simple implementation of the Linda distributed computing environment.

A simple implementation of Treyfer can be done as follows:

While elegant, in the simplest implementation this solution is not type-safe.

The following code example for the Java programming language is a simple implementation.

The following is a simple implementation of the algorithm in Octave.

The simplest implementation involves adding one square at a time.