pMATE: A Privacy-Preserving Map Retrieval Task Assignment Scheme in Spatial Crowdsourcing

Algorithm 3

FE.

	Input: int i;
	Output: int x[];   //the queue of the nearest TWs’ number
	Initialize int x[];
	Initialize int n, k;
	put i into x[];
	for j = 1 to n do
	if (mij.R = 0)
	put the j into x[];
	while x[n = 0] ! = null do;
	for k = 1 to int x[n]−1 do
	mkx[n].x ← mkx[n].x − 1;
	for k = int x[n] + 1 to n do
	mx[n]k.x ← mx[n]k.x − 1;
	n++;
	return x[];