User Tools

Site Tools


Sidebar

projects

wcp1 (due 20240828)
btt0 (due 20240904)
wcp2 (due 20240904)
pct0 (bonus; due 20240905)
pct1 (bonus; due 20240905)
pct2 (due 20240905)
abc0 (due 20240906)
msi0 (due 20240911)
pct3 (bonus; due 20240911)
wcp3 (due 20240911)
msi1 (due 20240918)
pct4 (due 20240918)
wcp4 (due 20240918)
msi2 (due 20240926)
pct5 (bonus; due 20240926)
wcp5 (due 20240926)
gfo0 (due 20241002)
msi3 (due 20241002)
pct6 (due 20241002)
wcp6 (due 20241002)
cgf0 (due 20241009)
pct7 (bonus; due 20241009)
wcp7 (due 20241009)
bwp1 (bonus; due 20241016)
cgf1 (due 20241016)
pct8 (due 20241016)
wcp8 (due 20241016)
cgf2 (due 20241023)
pct9 (bonus; due 20241023)
wcp9 (due 20241023)
gfo1 (due 20241030)
mag0 (due 20241030)
pctA (due 20241030)
wcpA (due 20241030)
mag1 (due 20241106)
pctB (bonus; due 20241106)
wcpB (due 20241106)
mag2 (due 20241113)
pctC (due 20241113)
wcpC (due 20241113)
pctD (bonus; due 20241120)
wcpD (bonus; due 20241120)
bwp2 (bonus; due 20241204)
gfo2 (due 20241204)
pctE (bonus; due 20241204)
wcpE (bonus; due 20241204)
EoCE (due 20241216)
haas:fall2024:data:projects:sll2:paradigms

Solution Paradigms

Recursion

Recursion is the effective calling (and nesting) of the same function over and over again to derive the solution (i.e. the work is accomplished through each successive function call).

Recursion is often considered more elegant, yet less efficient (the underlying work the computer must perform tends to be greater).

Here is an example of recursion to compute the sum of the first 10 integers (0-9):

1
#include <stdio.h>
 
int increment(int, int);
 
int main()
{
        int i = 0;
        int sum = 0;
 
        sum = increment(i, 10);
 
        fprintf(stdout, "sum is: %d\n", sum);
 
        return(0);
}
 
int increment(int value, int max)
{
        if (value < (max - 1))
                value = value + increment(value+1, max);
 
        return(value);
}

This program, when executed, will output:

$ ./recursion
sum is: 45
$ 

Iteration

On the other hand, iteration is more in line with how we're used to thinking (step by step, with each detail more tangible). The computer tends to work more in an iterative fashion, although solutions done iteratively may not appear as elegant as under other forms (recursion).

Here is an example of iteration to compute the sum of the first 10 integers (0-9):

1
#include <stdio.h>
 
int main()
{
        int i = 0;
        int sum = 0;
 
        for(i = 0; i < 10; i++)
                sum = sum + i;
 
        fprintf(stdout, "sum is: %d\n", sum);
 
        return(0);
}

This program, when executed, will output:

$ ./iteration
sum is: 45
$ 

Perspective

Recursion, like the use of pointers, structs, inheritance, polymorphism, etc. really lends itself well to larger, more complicated problems.

In the current setting, the iterative example likely looks far simpler (less code overall). This in no way implies recursion is inferior, as outside of potential performance issues, it is an effective way to solve problems, and being able to think recursively can improve one's problem solving skills overall.

haas/fall2024/data/projects/sll2/paradigms.txt · Last modified: 2015/10/15 21:11 by 127.0.0.1