Question

Recursive Quadratic Design 2: draw a picture of the data and give the formula, and type the algorithm for this program   

Due: ___________________   

​RECURSIVE QUADRATIC - Program 2(100 points) CS1311

​

Write a C program that finds the value of a specific quadratic function

f(x) = ax^2 + bx + c

where you pick a, b and c (before you program) to be non-zero integers.

Use the function we worked with in class!  Do not put a, b or c in the program.

Answer 1

#include <stdio.h>
#include<math.h>

int quadratic(double a, double b, double c, double *solution1, double *solution2){
   double d = b * b - 4.0 * a * c;
    if (d < 0)
    {
       *solution1 = 0;
       *solution2 = 0;
        return 0;
    }
    else if (d == 0)
    {
      *solution1 = -b / (2.0 * a);
        *solution2 = -b / (2.0 * a);
        return 1;
   }
    else
    {
        *solution1 =(-b + sqrt(d)) / (2.0 * a);
        *solution2 =(-b - sqrt(d)) / (2.0 * a);
        return 1;
    }
}

int main(int argc, char *argv[]) {
   
   double a, b, c, root1, root2, d;
 
   printf("Enter a: ");
   scanf("%lf",&a);
    printf("Enter b: ");
   scanf("%lf",&b);
    printf("Enter c: ");
   scanf("%lf",&c);
    
       d = b * b - 4.0 * a * c;
        if (d < 0)
        {
           printf("Complex conjugates\n");
        }
        else if (d == 0)
        {
           printf("Repeated real roots\n");
            root1 = -b / (2.0 * a);
            root2 = root1;
            printf("Root1 = %lf\n", root1);
            printf("Root2 = %lf\n", root2);
        }
        else if (d > 0 )
        {
           printf("Real distinct roots\n");
            root1 =(-b + sqrt(d)) / (2.0 * a);
            root2 =(-b - sqrt(d)) / (2.0 * a);
            printf("Root1 = %lf\n", root1);
            printf("Root2 = %lf\n", root2);
        }
    
   return 0;
}