progintro2012
Various versions of a conflict-free string generator, as presented in progintro TA class (2012).
- Quiet · last change 2-18-2012
- ★ 1 on GitHub
README
Various versions of a conflict-free string generator, as presented in progintro TA class (February 2012).
Author: Nick Korasidis
Problem: Given an integer d, where 1 <= d <= 26, output a maximal conflict-free string, using only d distinct lowercase latin letters.