Concept:

Single recursion

Recursion with only a single self-reference

The factorial function, as given in Language:Java below, uses single recursion.

	public static long factorial(int n) {
		if (n <= 1)
			return 1;
		else
			return n * factorial(n - 1);
	}

For comparison, the Fibonacci sequence uses binary recursion instead.

See also the illustrations of primitive recursion and tail recursion for some specific forms of single recursion.

◀

this

This user never has never made submissions.

For you are available next options:

will make text bold.

will make text italic.

will make text underlined.

will make text striked.

will allow you to paste code headline into the page.

will allow you to link into the page.

will allow you to paste code with syntax highlight into the page. You will need to define used programming language.

will allow you to paste image into the page.

is list with bullets.

is list with numbers.

will allow your to insert slideshare presentation into the page. You need to copy link to presentation and insert it as parameter in this tag.

will allow your to insert youtube video into the page. You need to copy link to youtube page with video and insert it as parameter in this tag.

will allow your to insert code snippets from @worker.