Inline Functions and Intro to Recursion0%

std::string Basics: Concatenation, length(), size(), and empty()

Inline Functions and Intro to Recursion

Beginner12 min read•Updated: 2026-10-22

⚡ Inline Functions and Intro to Recursion

Introduction

Small helper functions incur a micro-overhead when invoked (stack frame creation, register spilling, and instruction jumps). The inline keyword suggests that the compiler replace the function call directly with its body code. Conversely, recursion solves problems by having functions call themselves.

🚀 The `inline` Keyword

1#include <iostream>
2 
3inline int squareNumber(int x) {
4    return x * x;
5}
6 
7int main() {
8    // Compiler replaces this directly with: (5 * 5)
9    int result = squareNumber(5);
10    std::cout << "Square: " << result << "\n";
11    return 0;
12}

🔁 Introduction to Recursion

A recursive function requires two fundamental components:

1
Base Case: The condition where recursion stops.
2
Recursive Case: The step that reduces the problem towards the base case.

Factorial Example:

1#include <iostream>
2 
3uint64_t computeFactorial(uint32_t n) {
4    // 1. Base Case
5    if (n <= 1) {
6        return 1;
7    }
8    // 2. Recursive Case
9    return n * computeFactorial(n - 1);
10}
11 
12int main() {
13    uint32_t num = 5;
14    std::cout << "Factorial of " << num << " is: " << computeFactorial(num) << "\n";
15    return 0;
16}

Visualizing the Call Stack for `computeFactorial(3)`:

1[ computeFactorial(3) ] ──► returns 3 * computeFactorial(2)
2    [ computeFactorial(2) ] ──► returns 2 * computeFactorial(1)
3        [ computeFactorial(1) ] ──► returns 1 (Base Case hit!)
4Unwinding: 1 * 2 * 3 = 6

Next Lesson

std::string Basics: Concatenation, length(), size(), and empty()

Continue learning with hands-on practice, examples, and exercises in the upcoming topic.

Related Lessons

Previous Lesson	Next Lesson
Default Arguments and Function Overloading	std::string Basics: Concatenation, length(), size(), and empty()

Practice Quiz

Test your understanding of this lesson with 1 questions. Each question has one correct answer.

Previous Next

PreviousPrevNext

MSK Institute • Shikohabad

Loading Page Content...

Preparing courses, live labs, and learning resources.सामग्री लोड हो रही है, कृपया प्रतीक्षा करें...

Connecting serverPlease wait...

💻 Practical Labs🚀 Free Demo📜 Verified Certificates

std::string Basics: Concatenation, length(), size(), and empty()

Inline Functions and Intro to Recursion

Beginner12 min read•Updated: 2026-10-22

Study Materials

⚡ Inline Functions and Intro to Recursion

Introduction

🚀 The `inline` Keyword

1#include <iostream>
2 
3inline int squareNumber(int x) {
4    return x * x;
5}
6 
7int main() {
8    // Compiler replaces this directly with: (5 * 5)
9    int result = squareNumber(5);
10    std::cout << "Square: " << result << "\n";
11    return 0;
12}

🔁 Introduction to Recursion

A recursive function requires two fundamental components:

1
Base Case: The condition where recursion stops.
2
Recursive Case: The step that reduces the problem towards the base case.

Factorial Example:

1#include <iostream>
2 
3uint64_t computeFactorial(uint32_t n) {
4    // 1. Base Case
5    if (n <= 1) {
6        return 1;
7    }
8    // 2. Recursive Case
9    return n * computeFactorial(n - 1);
10}
11 
12int main() {
13    uint32_t num = 5;
14    std::cout << "Factorial of " << num << " is: " << computeFactorial(num) << "\n";
15    return 0;
16}

Visualizing the Call Stack for `computeFactorial(3)`:

1[ computeFactorial(3) ] ──► returns 3 * computeFactorial(2)
2    [ computeFactorial(2) ] ──► returns 2 * computeFactorial(1)
3        [ computeFactorial(1) ] ──► returns 1 (Base Case hit!)
4Unwinding: 1 * 2 * 3 = 6

Next Lesson

std::string Basics: Concatenation, length(), size(), and empty()

Continue learning with hands-on practice, examples, and exercises in the upcoming topic.

Related Lessons

Previous Lesson	Next Lesson
Default Arguments and Function Overloading	std::string Basics: Concatenation, length(), size(), and empty()

Practice Quiz

Test your understanding of this lesson with 1 questions. Each question has one correct answer.

Previous Next

⚡ Inline Functions and Intro to Recursion

Introduction

🚀 The inline Keyword

🔁 Introduction to Recursion

Factorial Example:

Visualizing the Call Stack for computeFactorial(3):

std::string Basics: Concatenation, length(), size(), and empty()

Related Lessons

Practice Quiz

Loading Page Content...

⚡ Inline Functions and Intro to Recursion

Introduction

🚀 The inline Keyword

🔁 Introduction to Recursion

Factorial Example:

Visualizing the Call Stack for computeFactorial(3):

std::string Basics: Concatenation, length(), size(), and empty()

Related Lessons

Practice Quiz

🚀 The `inline` Keyword

Visualizing the Call Stack for `computeFactorial(3)`:

🚀 The `inline` Keyword

Visualizing the Call Stack for `computeFactorial(3)`: