A software testing technique that involves ideNTifying a small set of represeNTative input values that invoke as many differeNT input conditions as possible. For example, for binary search the following partitions exist: inputs that do or do not conform to pre-conditions, Inputs where the key elemeNT is or is not a member of the array. One can combine these iNTo finer partitions. One can also pick specific conditions of the array, e.g. a single value, even or odd number of elemeNTs. One should look at boundary conditions, e.g. inputs where the key elemeNT is the first or last elemeNT in the array. (2004-01-18)