RECURSIONS, A PROGRAMMING CONCEPTS THAT ALLOWS FUNCTIONS AND MODULES TO CALL ITSELF: DESIGN, IMPLEMENTATION AND ANALYSIS
Keywords:
Function, Recursion, Modules and AnalysisAbstract
The objective of this work is to look at the features of these languages that allow itself to be called. One want to look at a function on how it either calls itself directly or calls a function that in turn calls the origin function. This function is called recursive function or module. This work would look at its properties, implementation, analysis and complexity. The result of all these features would be based on chosen examples of recursion.
References
McCarthy, J. (2002). “Actions and other events in situation calculus”. Proceedings KR-2002, 615 -628
B. Randell and C.J. Russel, the implementations of Algol 60, Academic Press, 1964
Wirth, N. (1976). Algorithm + Data Structures = Programs. Englewood’s Cliff, N.J. Prentice-Hall.
Peter, R. (1967). “Recursive functions”, Academic Press New York.
Kleene, S.C. (1967). “Mathematical Logic”, Wiley and Sons Press, New York.
Daniel Y. Liang (2011). Introduction Java Programming, Pearson Books N.J. U.S.A.
Deitel, P.J., & Deitel, H.M. (2009). Internet and World wide web-How to program, Pearson books N.J., U.S.A.
Deordney, A.K. (1993). The Tuning Omnibus, W.H. Freeman books New York, 2nd edition.
Manna, Z. (2000). Mathematic theory of computation Mc Grawhill, New York.
Mc Vite, D.G. & Wilson, L.B. (1971). The stable marriage problem, comm. A.C.M 14, N0. 7, 486-92.
Roberts, E.S. (1986). Thinking recursively, John Wiley and Sons New York.
Additional Files
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 International Educational Journal of Science and Engineering
This work is licensed under a Creative Commons Attribution 4.0 International License.
