BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

185What is a Function?
186Function Declaration Syntax
187Function Definition vs Declaration
188Calling Functions
189Return Statements
190Void Functions
191Function Naming Conventions
192Function Documentation
193Single Responsibility Principle
194Function Composition Basics
195Function Parameters: Passing Data to Functions
196Positional vs Named Parameters
197Default Parameter Values
198Variable Number of Arguments
199Return Statements and Values
200Multiple Return Values
201Void Functions and Side Effects
202Pass-by-Value Semantics
203Pass-by-Reference Semantics
204Const Parameters and Immutability
205Parameter Type Checking and Validation
206Function Signatures and Contracts
207What is Scope?
208Local Variables and Function Scope
209Global Variables
210Block Scope
211Shadowing: When Names Collide
212Variable Lifetime Basics
213Stack-Based Lifetime for Local Variables
214Static Lifetime Variables
215Scope and Lifetime: The Key Difference
216Best Practices for Variable Scope
217What is Recursion?
218Base Case and Recursive Case
219Anatomy of a Recursive Call
220Simple Recursion: Countdown
221Computing Factorials Recursively
222Fibonacci Sequence with Recursion
223Recursion vs Iteration
224Call Stack and Stack Overflow
225Recursive Problem Decomposition
226Multiple Recursive Calls
227Tail Recursion
228Converting Tail Recursion to Iteration
229Helper Functions in Recursion
230Debugging Recursive Functions
231Common Recursion Pitfalls

Computer Science

185What is a Function?
186Function Declaration Syntax
187Function Definition vs Declaration
188Calling Functions
189Return Statements
190Void Functions
191Function Naming Conventions
192Function Documentation
193Single Responsibility Principle
194Function Composition Basics
195Function Parameters: Passing Data to Functions
196Positional vs Named Parameters
197Default Parameter Values
198Variable Number of Arguments
199Return Statements and Values
200Multiple Return Values
201Void Functions and Side Effects
202Pass-by-Value Semantics
203Pass-by-Reference Semantics
204Const Parameters and Immutability
205Parameter Type Checking and Validation
206Function Signatures and Contracts
207What is Scope?
208Local Variables and Function Scope
209Global Variables
210Block Scope
211Shadowing: When Names Collide
212Variable Lifetime Basics
213Stack-Based Lifetime for Local Variables
214Static Lifetime Variables
215Scope and Lifetime: The Key Difference
216Best Practices for Variable Scope
217What is Recursion?
218Base Case and Recursive Case
219Anatomy of a Recursive Call
220Simple Recursion: Countdown
221Computing Factorials Recursively
222Fibonacci Sequence with Recursion
223Recursion vs Iteration
224Call Stack and Stack Overflow
225Recursive Problem Decomposition
226Multiple Recursive Calls
227Tail Recursion
228Converting Tail Recursion to Iteration
229Helper Functions in Recursion
230Debugging Recursive Functions
231Common Recursion Pitfalls

← Computer Science

Lesson 228 of 2,872·5. Functions and ModularityPro lesson

Converting Tail Recursion to Iteration

Transform tail-recursive functions into iterative loops to avoid stack growth and improve efficiency.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course