Click here to Skip to main content
13,355,726 members (63,274 online)
Click here to Skip to main content

Stats

181.2K views
1.9K downloads
179 bookmarked
Posted 11 Jul 2012
MIT

How to replace recursive functions using stack and while-loop to avoid the stack-overflow

, 1 Jul 2015
This article explains 10 rules (steps) for replacing the recursive functions using stack and while-loop to avoid the stack-overflow.

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The MIT License

Share

About the Author

Woong Gyu La
Software Developer
Canada Canada
Woong Gyu La had been working as a software developer for over 8 years.
His personal interests are improving his personal projects,

EpLibrary (Visual C++ Utility Library)
https://github.com/juhgiyo/EpLibrary[^]

EpOraLibrary (Oracle OCI Wrapper Library for Visual C++)
https://github.com/juhgiyo/EpOraLibrary[^]

EpServerEngine (Visual C++ WinSock Server/Client Engine)
https://github.com/juhgiyo/EpServerEngine[^]

And other projects can be found at
https://github.com/juhgiyo?tab=repositories[^]

Finally, my other articles can be found at
http://www.codeproject.com/Articles/juhgiyo#articles[^]

You can contact me at juhgiyo@gmail.com[^]

You may also be interested in...

Pro
Pro
Permalink | Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.180111.1 | Last Updated 2 Jul 2015
Article Copyright 2012 by Woong Gyu La
Everything else Copyright © CodeProject, 1999-2018
Layout: fixed | fluid