answersLogoWhite

0

A recursive call in an algorithm is when a function (that implements this algorithm) calls itself.

For example, Quicksort is a popular algorithm that is recursive.

The recursive call is seen in the last line of the pseudocode, where the quicksort function calls itself.

function quicksort('array') create empty lists 'less' and 'greater' if length('array') ≤ 1 return 'array' // an array of zero or one elements is already sorted select and remove a pivot value 'pivot' from 'array' for each 'x' in 'array' if 'x' ≤ 'pivot' then append 'x' to 'less' else append 'x' to 'greater' return concatenate(quicksort('less'), 'pivot', quicksort('greater'))

User Avatar

Wiki User

13y ago

Still curious? Ask our experts.

Chat with our AI personalities

DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
More answers

An algorithm is a set of instructions that do some task. An algorithm can recursive or non recursive calls. A recursive call is when a function calls itself.

User Avatar

Wiki User

10y ago
User Avatar

Add your answer:

Earn +20 pts
Q: What is recursive call in terms of algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp