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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.