Test: recurison vs. not (trivial)

What is the cost of a recursive algorithm vs. a non-recursive one?

Run this test again Return to test menu

Result: Discarded

The test labeled "recursive" was the faster by 0.0027 seconds, (0.251% faster)

recursive 100%

non-recursive 99.749%

The recursive test took 1.0805 seconds.
The non-recursive test took 1.0832 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 298,102 loops for a total of 5,962,040 runs.

Line execution difference (0.000000) milliseconds.
Avg difference (0.136) milliseconds per 298,102 loops.
Total difference 2.72 milliseconds for 5,962,040 loops

The iteration variablity for Code 1 was (3.1905) milliseconds and Code 2 was (2.7335) milliseconds. The lower and the closer together there values are the more accurate the results are.

Code

The first test, "non-recursive", was:

/*
function recurse_not($i)
{
	$result = 0;

	while ($i > 0)
	{
		$result += $i;
		$i -= 5;
	}

	return $result;
}
*/

$result = recurse_not(5000);

The second test, "recursive", was:

/*
function recurse_normal($i)
{
	if ($i > 0)
		return $i + recurse_normal($i - 5);
	else
		return 0;
}
*/

$result = recurse_normal(5000);

PHP Benchmarks