For these good examples, it is easily develop a good iterative version of the same algorithm that will run quicker. In fact recursion and iteration are related; languages without iteration simulate it utilizing recursion and vice versa.

However, more interesting examples, like the sorting routines we discuss later, don't have a clear iterative solution. Whenever a solution is discovered, it is often much longer than the recursive version.

The same is true for algorithms based on recursively-defined data structures, such as the Binary Tree ADT.

- Math and Science
- Computer Science
- Languages:C/C++/C#,Java, VB, .Net
- Databases: SQL, Oracle, SQL Server
- Mysql Database
- Data structures and algorithm
- Operating Systems Help
- Computer Networks Help
- UML Diagrams Help
- Python Help
- Java Help
- Java Servlets Help
- Information Technology
- English Help
- Law Help
- Coursework Help
- Help With Assignment

- Engineering
- Business studies