Deduce the algorithm:
Press the Generate button a few times and try to figure out an algorithm that expresses the relation between the Input and the Expected result.
Edit and Run your Prequel program.
Test as many instances as needed with Retry while ok.
ALGO.INPUTInteger or listfrom which the expected result must be calculatedand returned through procedure ALGO.RETURN.MODULE.CALL.ARGSHolds the list of arguments passed with MODULE.CALL.-> [arg1, ..., argN]
ALGO.RETURN(result)End computation andcompare the calculated resultagainst the expected result.Succeeds if there is a match; fails otherwise.MODULE.CALL(&retvar1, ..., &retvarM, @modname, arg1, ..., argN)Start executing module modname, copying N arguments and expecting M return values.-> retvar: name of variable to hold the corresponding return value retval-> modname: name of module to start executing-> arg: value to be copied to the list MODULE.CALL.ARGSAlternative syntax: retvar1, ..., retvarM := MODULE.CALL(@modname, arg1, ..., argN)Note that recursive module calls are not allowed.MODULE.RETURN(retval1, ..., retvalM)Return M values from the current module.Resume execution at the next instruction of the corresponding MODULE.CALL.-> retval: value to be copied to the corresponding variable retvar