A Trace table is a technique used to test algorithms, in order to make sure that no logical errors occur whilst the algorithm is being processed. When executing a dry run of an algorithm we record the state of the algorithm after each instruction. Generally, we define the state of an algorithm as: The contents of any variables that have been declared during the execution of the algorithm. To record the state of an algorithm we use a trace table.
Read this topic