Test: recurison vs. not (trivial)

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

View test history (1) Run this test again Return to test menu

Result: Saved

The test labeled "non-recursive" was the faster by 0.0011 seconds, (0.219% faster)

non-recursive 100%

recursive 99.781%

The non-recursive test took 0.5095 seconds.
The recursive test took 0.5106 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 138,872 loops for a total of 2,777,440 runs.

Line execution difference (0.000000) milliseconds.
Avg difference (0.056) milliseconds per 138,872 loops.
Total difference 1.12 milliseconds for 2,777,440 loops

The iteration variablity for Code 1 was (0.9105) milliseconds and Code 2 was (0.8007) 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