Recursion For Programmers

Recursion For Programmers, available at $59.99, has an average rating of 4.45, with 31 lectures, 2 quizzes, based on 111 reviews, and has 1014 subscribers.

You will learn about Call functions recursively Understand how recursion works Understand the stack and stack frames Avoid stack corruption Use recursion in any mainstream programming language Know the pros and cons of recursion and iteration Navigate tree structures Traverse disk directories recursively Code samples in C, Java, Ruby This course is ideal for individuals who are Programmers who want to understand recursion in depth or Anyone who needs to extend their knowledge of algorithms and data structures It is particularly useful for Programmers who want to understand recursion in depth or Anyone who needs to extend their knowledge of algorithms and data structures.

Enroll now: Recursion For Programmers

Summary

Title: Recursion For Programmers

Price: $59.99

Average Rating: 4.45

Number of Lectures: 31

Number of Quizzes: 2

Number of Published Lectures: 31

Number of Published Quizzes: 2

Number of Curriculum Items: 33

Number of Published Curriculum Objects: 33

Original Price: $39.99

Quality Status: approved

Status: Live

What You Will Learn

Call functions recursively

Understand how recursion works

Understand the stack and stack frames

Avoid stack corruption

Use recursion in any mainstream programming language

Know the pros and cons of recursion and iteration

Navigate tree structures

Traverse disk directories recursively

Code samples in C, Java, Ruby

Who Should Attend

Programmers who want to understand recursion in depth

Anyone who needs to extend their knowledge of algorithms and data structures

Target Audiences

Programmers who want to understand recursion in depth

Anyone who needs to extend their knowledge of algorithms and data structures

Recursion is a powerful programming technique. A function that calls itself recursively not only saves programming effort and avoids repetition but it can also be used to navigate complex structures such as Trees and Class Hierarchies.

This is an intermediate-to-advanced level course. It is aimed at programmers who can already program confidently in one or more programming languages. It isnot appropriate for beginners.

The courses includes numerous short sample programs to show how recursion works. There are samples written in C, Ruby and C#. However, you don’t need to program in those languages to follow this course. Recursion works the same way in all mainstream programming languages. This course explains the theory and the practice of recursion. You can use the techniques that are taught to write recursive functions in whichever language you prefer: C, C#, Java, JavaScript, Python, Basic, Pascal and others. The course is not about any specific language.

This is what you will learn…

What is recursion?

How variables are scoped in recursive functions

How recursive functions return values

The Stack and Stack Frames

Debugging recursive functions

Recursion v Iteration

Stack Corruption, and how to avoid it

Infinite Recursion, and how to avoid it

Recursing Fibonacci Numbers

Recursing a Class Hierarchy

Trees and recursion

Navigating subdirectories recursively

Code samples provided in C, Java, Ruby

Course Curriculum

Chapter 1: Understanding Recursion

Lecture 1: What is this course about?

Lecture 2: How to follow this course

Lecture 3: Source Code Archive [DOWNLOAD]

Lecture 4: Java Code Archive

Lecture 5: Readme

Lecture 6: What is Recursion For?

Lecture 7: A Simple Recursive Function

Lecture 8: Debugging Recursion

Lecture 9: Recursion and variable scope

Lecture 10: How recursion works

Lecture 11: Recursion and Stack Frames

Lecture 12: Debugging the Call Stack

Lecture 13: Deeper into Recursion

Lecture 14: Recursion in Ruby

Lecture 15: Recursive Functions that return values

Lecture 16: Return values are special

Lecture 17: Recursion, Iteration or Arithmetic

Chapter 2: Using Recursion

Lecture 1: Recursing Fibonacci Numbers

Lecture 2: Iterating Fibonacci Numbers

Lecture 3: Infinite Recursion

Lecture 4: The order of arguments

Lecture 5: Stack Corruption

Lecture 6: How Does Stack Corruption Occur?

Lecture 7: How The Stack Grows

Lecture 8: Stack Frames

Lecture 9: Recursing a class library

Lecture 10: Recursing through tree structures

Lecture 11: Directory Navigation – an example in C

Lecture 12: Directory Navigation – an example in Ruby

Lecture 13: Summary of Directory Navigation

Lecture 14: What next?

Instructors

Huw Collingbourne
Director of Technology, SapphireSteel Software

Rating Distribution

1 stars: 1 votes

2 stars: 4 votes

3 stars: 17 votes

4 stars: 31 votes

5 stars: 58 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!