Lesson 11 of 20

6 mins read

11. Recursion & High-Speed Function Pointers

In Plain English

A function pointer stores the memory address of an executable function in the code text segment. Function pointers enable dynamic dispatch, strategy patterns, and custom comparator callbacks for standard library algorithms like qsort().

The Mental Model

"A regular pointer points to a data record on a shelf; a function pointer points to a button on the wall that executes a specific action when pushed."

Deep Dive: How It Works

Function Pointers in Memory: Functions reside in the executable code segment of process RAM.

Comparator Signature: int (*cmp)(const void *a, const void *b) for standard library qsort.

Recursion Mechanics: Each recursive call adds a new stack frame; base cases are mandatory.

Syntax Blueprint

int (*operation)(int, int) = add;
int result = operation(10, 20);

Declare function pointer matching signature and assign target function address.

Core Rules to Remember

Callback Mechanisms: Enables decoupling algorithm logic from data comparison or event handling.

qsort Integration: Standard C high-speed quicksort accepting custom void* comparator pointers.

Zero Overhead: Direct indirect branch machine instruction call without virtual table lookup.

Common Beginner Traps & How to Fix Them

Mistake:Declaring function pointer without parentheses around (*ptrName): int *ptr(int, int).

Why it happens: Without parentheses, this declares a function returning an int pointer rather than a pointer to a function.

How to fix: Always write int (*ptr)(int, int).

Pro Tip: Use typedef to define clean names for complex function pointer signatures: typedef int (*Comparator)(const void *, const void *);

Live Interactive Example

Hit Run Code to see it live

Quicksort with Custom Comparator

C11 / GCC 9.2

Output Console

Click "Run Code" to view the rendered output.

How it works: qsort uses the ascending function pointer callback to sort array elements in-place.

Your Turn: Micro Challenge

No pressure! Edit the starter code below and test your solution with instant feedback.

Micro Exercise

Inspect Sorted Median with qsort

Print the sorted median element at index 2 with "Median: %d\n".

Sandbox Output

Click "Run & Check" to test your solution.

Finished reading and practicing?

Mark this lesson as completed to update your course progress.