EQUIVALENCE CLASS PARTITIONING
\ɪkwˈɪvələns klˈas pɑːtˈɪʃənɪŋ], \ɪkwˈɪvələns klˈas pɑːtˈɪʃənɪŋ], \ɪ_k_w_ˈɪ_v_ə_l_ə_n_s k_l_ˈa_s p_ɑː_t_ˈɪ_ʃ_ə_n_ɪ_ŋ]\
Definitions of EQUIVALENCE CLASS PARTITIONING
Sort: Oldest first
A software testing technique that involvesidentifying a small set of representative input values thatinvoke as many different input conditions as possible.For example, for binary search the following partitionsexist: inputs that do or do not conform to pre-conditions,Inputs where the key element is or is not a member of thearray. One can combine these into finer partitions. One canalso pick specific conditions of the array, e.g. a singlevalue, even or odd number of elements. One should look atboundary conditions, e.g. inputs where the key element isthe first or last element in the array.
By Denis Howe