October 2025
Intermediate to advanced
241 pages
4h 6m
English
The mathematical sequence factorial is defined recursively as
f(n) = {
1 if n <= 1,
n * f(n – 1) if n > 1
}
We’re now going to create the recursive function factorial both in c and in assembly language. The trick to programming recursively is to keep calling the recursive case until you reach the base case where f(n) = 1. The file factorial.c is shown in Listing 7-1, and factorial.asm is shown in Listing 7-2.
The way in which you invoke Makefile (Listing 7-3) determines ...
