Click here to Skip to main content
Click here to Skip to main content
Articles » Languages » C / C++ Language » Howto » Statistics
 
Add your own
alternative version

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

, 27 Oct 2014 MIT
This article explains 10 rules (steps) for replacing the recursive functions using stack and while-loop to avoid the stack-overflow.

Statistics


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
Korea (Republic Of) Korea (Republic Of)
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[^]
Follow on   Twitter   Google+   LinkedIn

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.150129.1 | Last Updated 27 Oct 2014
Article Copyright 2012 by Woong Gyu La
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid