Skip to main content
. 2020 Jul 27;20(15):4171. doi: 10.3390/s20154171
Algorithm 3 CAO (c, A)

  1.  {

  2.   count: = 0;

  3.   for i: =0 to 5 do

  4.   {

  5.    p:= cvi;

  6.    if (PIA(p, A) == 1) then count: = count + 1;

  7.   }

  8.   if (count > 0) then return 1;

  9.   else return 0;

  10.  }