n (Computer Science) computing a subroutine that can call itself as part of its execution
recursive subroutine
recursive subroutine
[ri′kər·siv ′səb·rü‚tēn] (computer science) A reentrant subroutine whose partial results are stacked, with a processor stack pointer advancing and retracting as the subroutine is called and completed.