Question

Need help in my C language assignment... all I need to do is

1.Use recursion instead

2. NO LOOPS ALLOWED

Output _______________________________________

What number shall I start with?  16
  sequence: 16 8 4 2 1
  length: 5
  largest: 16

  For start values from 1 to 16:

  longest: 9 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
  length: 20

  containing largest: 15 46 23 70 35 106 53 160 80 40 20 10 5 16 8 4 2 1
  largest: 160

_____________________________________________________________

// Creates the next input in a sequence int next(int n) int x = n; if (x % 2 == 0) x = x/ 2; return x; else + 1; x = 3 * x return x;

I'll write the another functions after I get an idea on what to do

Answer 1

#include<stdio.h>
int next(int n)
{
    int x = n;
    if(x%2 == 0)
    {
        x = x/2;
        return x;
    }
    else
    {
        x = 3 * x + 1;
        return x;
    }
}
void PrintSequence(int n)
{
    int x = n;
    if(x <=1)
    {
        printf("1");
        return 0;
    }
    printf("%i ",x);
    x = next(x);
    //recursive calling of PrintSequence
    //This will print the number every which will return by next(x)
    PrintSequence(x);
   
}
int length(int n)
{
   
    static int count = 1;
    int x = n;
    if(x<=1)
    {
        return 0;
    }
    x = next(x);
    count++;
    //recursive calling of function length()
    length(x);
    return count;
}
int largest(int n)
{
    //static varibale not intialized again once it executed
    static int max = 0;
    int x = n;
    if(x<=1)
    {
        return 0;
    }
    if(max<=x)
    {
        max = x;
    }
    x = next(x);
    //recursive calling of function largest
    largest(x);
    return max;
}
int main()
{
    int n,count=0,max = 0;
    printf("Enter n value: ");
    scanf("%d",&n);
    printf("Sequence: ");
    PrintSequence(n);
    count = length(n);
    printf("\nLength: %d\n",count);
    max = largest(n);
    printf("Largest: %d",max);
    return 0;
}

#include<stdio.h> 2 int next(int n) int x = n; if(x%2 == 0) X = x/2; return x; else + 1; X = 3 * x return x; 15 } 16 void PrintSequence (int n) 17 int x = n; if(x <=1) printf("1"); return 0; printf("%i ",x); X = next(x); 7/recursive calling of PrintSequence //This will print the number every which will

//recursive calling of PrintSequence 27 | //This will print the number every which will return by next(x) 28 PrintSequence(x); 29 30 } 31 int length(int n) 32 { static int count = 1; int X = n; if(x<=1) return 0; BÛ Ê X = next(x); count++; //recursive calling of function length(); length(x); return count; 45 } 46 int largest(int n) 47 { //static varibale not intialized again once it executed static int max = 0; int x = n; 48 49

int x = n; if(x<=1) return 0; if(max<=x) max = x; X = next(x); //recursive calling of function largest largest(x); return max; 63 } 64 int main() 65{ int n, count=0, max = 0; printf("Enter n value: "); scanf("%d",&n); printf("Sequence: "); PrintSequence(n); count = length(n); printf("\nLength: %d\n", count); max = largest(n); printf("Largest: %d", max); return 0;

Enter n value: 15 Sequence: 15 46 23 70 35 106 53 160 80 40 20 10 5 16 8 4 2 1 Length: 18 Largest: 160

Enter n value: 9 Sequence: 9 28 14 7 22 11 34 17 52 26 134 0 20 10 5_16 8 4 2 1 Length: 20 Largest: 52

Enter n value: 16 Sequence: 16 8 4 2 1 Length: 5 Largest: 16