Combinatorial

A greedy algorithm for building covering arrays — small sets of test cases that exercise every t-way combination of input parameters.

In-Parameter-Order generation: builds a covering array incrementally, extending coverage one parameter at a time.

Browse standard (Taguchi) orthogonal arrays — pre-calculated, perfectly balanced designs where every pair of factors is covered equally often.