An Enhanced Adaptive Random Testing by Dividing Dimensions Independently

Algorithm 1

LCS-FSCS algorithm.

Input:
(1)	The size of candidate set (CS) is denoted as k
(2)	The input domain D
(3)	The dimension number (n) of input domain
(4)	The partition number () of each dimension
Output:
The set of test cases TS
(1)	Input parameters k, n, D, and ;
(2)	Set TS = {},  = {};
(3)	Dividing each dimension into equal parts //(Definition 1) Init D domain;
(4)	Set ; //init
(5)	while (termination condition is not satisfied) do
(6)	tc = Call procedure GenTcByLCSFscs (, TS); //to get a “best” test case tc from domain;
(7)	Add tc into TS;
(8)	if tc is in the failure domain, then break;
(9)	end while
(10)	return TS;