Algoritm PDF

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

char *rf, *lf, *mainf, *idlef;

char state;

#ifdef TYPE1
mainf = rf;
idlef = lf;
#elif
mainf = lf;
idlef = rf;
#endif

state = 1;
while state < MAX_STATES
{
error_type1 = do_specific_task1();

if (!error_type1)
{

*mainf = 0;
*idlef = -1;

while (*mainf < state)

if ( (mainf == INT_DOUBLE - 1) | (mainf == FIN_DOUBLE - 1)


)
{

*mainf+=2;
*idlef = *mainf - 1;
}
else
{
*mainf++
*idlef = -1;
}

error_type2 = do_specific_task2(mainf, idlef);

if error_type2
{
break;
}

if !error_type2
{

error_type3 = do_specific_task3();

if error_type3
{
break;
}
while (*mainf > 0)

if (mainf == INT_DOUBLE + 2)
{

*mainf-=2;
*idlef = *mainf + 1;
}
elseif (mainf == FIN_DOUBLE)
{
aux = *mainf;
*mainf = *idlef;
*idlef = aux;
}

else
{
*mainf--
*idlef = -1;
}

error_type2 = do_specific_task2(mainf, idlef);

if error_type2
{
break;
}

if ((!error_type2)&&(!error_type3))
{
state++;
}

if state > MAX_STATES


{
printf(“Ready\n”);
return;
}

You might also like