Test: recurison vs. not (trivial)

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

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

Result: Discarded

The test labeled "recursive" was the faster by 0.0785 seconds, (6.124% faster)

recursive 100%

non-recursive 93.876%

The recursive test took 1.204 seconds.
The non-recursive test took 1.2825 seconds.

Nitty-Gritty

Each test case ran 20 random code order iterations consisting of 276,577 loops for a total of 5,531,540 runs.

Line execution difference (0.000014) milliseconds.
Avg difference (3.927) milliseconds per 276,577 loops.
Total difference 78.54 milliseconds for 5,531,540 loops

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