Updated (shortened) Newton polynomial printing, added simplified polynomial printing

README.md

@@ -1,3 +1,3 @@
 # Polynomial Interpolation
 
-ANSI C program which composes polynomial of n - 1 degree for n dots.
+ANSI C program which composes polynomial of n - 1 degree that passes through n dots.

main.c

@@ -1,319 +1,235 @@
-#include <stdio.h>
-#include <stdlib.h>
-
 #include "./polynominal_interpolation.h"
 
-/*
+/* Utils */
- Utils
-*/
 
-int min(int a, int b)
+double fabs(double x)
 {
-    return (a + b - abs(a - b)) / 2;
+  return x > 0 ? x : -x;
-}
-
-int max(int a, int b)
-{
-    return (a + b + abs(a - b)) / 2;
 }
 
 /*
- Array utils
+ Newton interpolation polynomial
 */
 
-arr *init(int n)
+/* Divided difference is evaluated for:
+   array y stands for f(x)
+   array x stands for x
+   number i stands for index of evaluated difference (from 0)
+   number d stands for order of difference (from 0)
+   example: https://shorturl.at/tBCPS */
+double div_diff(double *y, double *x, unsigned int i, unsigned int d)
 {
-    arr *a = (arr *)malloc(sizeof(arr));
+  return (y[i] - y[i - 1]) / (x[i] - x[i - d]);
-
-    a->size = n;
-
-    a->p = (double *)malloc(sizeof(double) * n);
-    for (int i = 0; i < n; i++)
-        set(a, i, 0);
-
-    return a;
 }
 
-arr *resize(arr *a, int new_size)
+/* Evaluates divided differences of n values - array of some kind of derivatives with big enough dx
+   Example: https://shorturl.at/tBCPS
+   Warning: result is evaluated in `double *y` array */
+double *div_diff_es(double *x, double *y, unsigned int n)
 {
-    if (a->size == new_size)
+  for (int i = 1; i < n; i++)        // first element remains unchanged
-        return a;
+    for (int j = n - 1; j >= i; j--) // evaluate from the end of array, decreacing number of step every repeation
+      y[j] = div_diff(y, x, j, i);
 
-    double *new_p = (double *)malloc(sizeof(double) * new_size);
+  return y;
-    for (int i = 0; i < min(new_size, a->size); i++)
-        new_p[i] = get(a, i);
-
-    free(a->p);
-
-    for (int i = a->size; i < new_size; i++)
-        new_p = 0;
-
-    a->p = new_p;
-    a->size = new_size;
-
-    return a;
-}
-
-int convert_addr(arr *a, int pos)
-{
-    pos = pos % a->size;
-    if (pos < 0)
-        pos = a->size + pos;
-
-    return pos;
-}
-
-double get(arr *a, int pos)
-{
-    pos = convert_addr(a, pos);
-
-    return a->p[pos];
-}
-
-void set(arr *a, int pos, double val)
-{
-    pos = convert_addr(a, pos);
-
-    a->p[pos] = val;
-
-    // printa(a, 1);
-}
-
-arr *add(arr *a, arr *b)
-{
-    for (int i = 0; i < a->size; i++)
-        set(a, i, a->p[i] + b->p[i]);
-
-    return a;
-}
-
-arr *mult(arr *a, double mul)
-{
-    arr *res = init(a->size);
-
-    for (int i = 0; i < a->size; i++)
-        set(res, i, a->p[i] * mul);
-
-    return res;
-}
-
-void printa(arr *a, int q)
-{
-    if (q)
-    {
-        for (int i = 0; i < a->size; i++)
-            printf("%f ", get(a, i));
-        printf("\n");
-
-        return;
-    }
-
-    printf("Array of size %d:\n", a->size);
-
-    for (int i = 0; i < a->size; i++)
-        printf("%5d ", i + 1);
-    printf("\n");
-
-    for (int i = 0; i < a->size; i++)
-        printf("%5.2f ", get(a, i));
-    printf("\n");
-}
-
-arr *arr_without_el(arr *a, int ex_pos)
-{
-    arr *res = init(a->size - 1);
-    for (int i = 0, pos = 0; i < a->size; i++)
-    {
-        if (i == ex_pos)
-            continue;
-        set(res, pos, a->p[i]);
-        pos++;
-    }
-
-    return res;
-}
-
-arr *reverse(arr *a)
-{
-    arr *res = init(a->size);
-    for (int i = 0; i < a->size; i++)
-        set(res, i, a->p[a->size - 1 - i]);
-
-    return res;
-}
-
-void free_arr(arr *a)
-{
-    free(a->p);
-    free(a);
 }
 
 /*
- Business logic
+ Coeficients of simplified polynomial computation
 */
 
-int has_comb(int *arr, int n, int k)
+void simplify_polynomial(double *res, double *rev_el_coef, double *x, unsigned int n)
 {
-    if (n == k)
+  for (int i = 0; i < n; i++)
-        return 0;
+    if (rev_el_coef[i])
+      for (int j = 0; j <= i; j++)
+        res[i - j] += (j % 2 ? -1 : 1) * rev_el_coef[i] * compute_sum_of_multiplications_of_k(x, j, i);
+}
 
-    int pos = k - 1;
+double compute_sum_of_multiplications_of_k(double *arr, unsigned int k, unsigned int n)
+{
+  if (k == 0)
+    return 1;
 
-    if (arr[pos] == n - 1)
+  if (k == 1 && n == 1)
+    return arr[0];
+
+  unsigned int *selected = (unsigned int *)malloc(sizeof(unsigned int) * k); // Indexes of selected for multiplication elements
+
+  int i = 0, // index of `arr` array
+      j = 0; // index of `selected` array
+
+  double sum = 0;
+
+  while (j >= 0)
+  {
+    if (i <= (n + (j - k)))
     {
-        if (k == 1)
+      selected[j] = i;
-            return 0;
 
-        while ((pos > 0) && arr[pos] == n - 1)
+      if (j == k - 1)
-        {
+      {
-            pos--;
+        sum += mult_by_indexes(arr, selected, k);
-            arr[pos]++;
+        i++;
-        }
+      }
-
+      else
-        for (int i = pos + 1; i < k; i++)
+      {
-            arr[i] = arr[i - 1] + 1;
+        i = selected[j] + 1;
-
+        j++;
-        if (arr[0] > n - k)
+      }
-            return 0;
     }
     else
-        arr[pos]++;
-
-    return 1;
-}
-
-int mult_by_index(arr *a, int *coords, int n)
-{
-    double res = 1;
-    for (int i = 0; i < n; i++)
-        res = res * get(a, coords[i]);
-
-    return res;
-}
-
-int sum_of_mult_of_n_combinations(arr *a, int n)
-{
-    if (n == 0)
-        return 1;
-
-    if (a->size == 1)
     {
-        return a->p[0];
+      j--;
+      if (j >= 0)
+        i = selected[j] + 1;
     }
+  }
 
-    double acc = 0;
+  free(selected);
 
-    int coords[n];
+  return sum;
-    for (int i = 0; i < n; i++)
-        coords[i] = i;
-
-    acc += mult_by_index(a, coords, n);
-    while (has_comb(coords, a->size, n))
-        acc += mult_by_index(a, coords, n);
-
-    return acc;
 }
 
-int compose_denominator(arr *a, int pos)
+double mult_by_indexes(double *arr, unsigned int *indexes, unsigned int size)
 {
-    double res = 1;
+  double res = 1;
-    for (int i = 0; i < a->size; i++)
+  for (int i = 0; i < size; i++)
-    {
+    res *= arr[indexes[i]];
-        if (i == pos)
-            continue;
 
-        res = res * (get(a, pos) - get(a, i));
+  return res;
-    }
-    return res;
 }
 
-arr *compose_interpolation_polynomial(arr *xes, arr *ys)
+/*
+ User Interface 
+*/
+
+/* Prints interpolation polynomial in Newton notation */
+void print_newton_poly(double *f, double *x, unsigned int n)
 {
-    arr *res = init(xes->size);
+  printf("Newton polynomial form:\n");
-
+  for (int i = 0; i < n; i++)
-    arr *jcoef = init(xes->size);
+  {
-    for (int j = 0; j < xes->size; j++)
+    if (f[i]) // If coefficient != 0
     {
-        int minus = (!(xes->size % 2) ? -1 : 1);
+      /* Coefficient sign and sum symbol */
-        double denominator = compose_denominator(xes, j);
+      if (i > 0 && f[i - 1]) // If it's not the first summond
-        double multiplicator = get(ys, j);
+      {
+        if (f[i] > 0)
+          printf("+ ");
+        else
+          printf("- ");
+      }
+      else if (f[i] < 0) // If it is the first summond and coefficient is below zero
+        printf("-");
 
-        arr *xis = arr_without_el(xes, j);
+      printf("%lf", fabs(f[i])); // Print coefficient without sign
 
-        for (int i = 0; i < xes->size; i++)
+      for (int j = 0; j < i; j++) // For each (x-xi) bracket
+      {
+        if (x[j]) // If summond is not zero, print it
         {
-            double k_sum = sum_of_mult_of_n_combinations(xis, xes->size - 1 - i);
+          if (x[j] > 0)
-            set(jcoef, i, minus * (multiplicator * k_sum) / denominator);
+            printf("*(x-%lf)", x[j]);
-            minus = -minus;
+          else
+            printf("*(x+%lf)", -x[j]);
         }
+        else
+          printf("*x");
+      }
 
-        res = add(res, jcoef);
+      printf(" ");
-
-        free_arr(xis);
     }
+  }
 
-    free_arr(jcoef);
+  printf("\n");
-
-    return res;
 }
 
-int main(int argc, char *argv[])
+unsigned int insert_n()
 {
-    int quiet_mode = 0;
+  printf("Insert number of dots: ");
-    if (argc > 1 && argv[1][0] == '-' && argv[1][1] == 'q')
+  unsigned int n = 0;
-        quiet_mode = 1;
+  scanf("%u", &n);
 
-    if (!quiet_mode)
+  return n;
-        printf("Insert number of dots: ");
+}
-    int n = 6;
-    scanf("%d", &n);
 
-    if (!quiet_mode)
+void insert_coords(double *xes, double *yes, unsigned int n)
-        printf("Insert dots coordinates in the following format:\n<x> (space) <y>\nEach dot on new line\n");
+{
+  printf("Insert dots coordinates in the following format:\n<x> (space) <y>\nEach dot on new line\n");
 
-    arr *xes = init(n);
+  for (int i = 0; i < n; i++)
-    arr *ys = init(n);
+  {
+    double x, y;
+    scanf("%lf %lf", &x, &y);
 
-    // set(xes, 0, 1);
+    xes[i] = x;
-    // set(ys, 0, 1);
+    yes[i] = y;
-    // set(xes, 1, 2);
+  }
-    // set(ys, 1, 2);
+}
-    // set(xes, 2, 3);
-    // set(ys, 2, 3);
-    // set(xes, 3, 4);
-    // set(ys, 3, 4);
-    // set(xes, 4, 5);
-    // set(ys, 4, 5);
-    // set(xes, 5, 6);
-    // set(ys, 5, 6);
 
-    for (int i = 0; i < n; i++)
+void print_array(double *arr, unsigned int n)
+{
+  printf("Simplified coefficients array (starting from 0 upto n-1 power):\n");
+
+  for (int i = 0; i < n; i++)
+    printf("%lf ", arr[i]);
+
+  printf("\n");
+}
+
+void print_poly(double *coef, unsigned int n)
+{
+  printf("Simplified polynom:\n");
+
+  for (int i = 0; i < n; i++)
+  {
+    if (coef[i])
     {
-        double x, y;
+      if (i > 0 && coef[i - 1])
-        scanf("%lf %lf", &x, &y);
+        if (coef[i] > 0)
+          printf("+ ");
+        else
+          printf("- ");
+      else
+        printf("-");
 
-        set(xes, i, x);
+      printf("%lf", fabs(coef[i]));
-        set(ys, i, y);
+      if (i > 0)
+        printf("*x");
+      if (i > 1)
+        printf("^%d ", i);
+      else printf(" ");
     }
+  }
 
-    if (!quiet_mode)
+  printf("\n");
-    {
+}
-        printf("Inserted the following doths:\n");
-        printa(xes, 0);
-        printa(ys, 0);
-    }
 
-    arr *res = compose_interpolation_polynomial(xes, ys);
+/* 
+ Main
+*/
 
-    if (!quiet_mode)
+int main()
-        printf("Resulting polynomial will have such coeficients:\n");
+{
-    arr *reversed = reverse(res);
+  unsigned n = insert_n();
-    printa(reversed, quiet_mode);
 
-    free_arr(reversed);
+  double *x = (double *)malloc(sizeof(double) * n),
-    free_arr(res);
+         *y = (double *)malloc(sizeof(double) * n);
-    free_arr(xes);
-    free_arr(ys);
 
-    return 0;
+  insert_coords(x, y, n);
+
+  double *f = div_diff_es(x, y, n);
+
+  print_newton_poly(f, x, n);
+
+  double *coefficients = (double *)malloc(sizeof(double) * n);
+
+  simplify_polynomial(coefficients, f, x, n);
+
+  print_array(coefficients, n);
+
+  print_poly(coefficients, n);
+
+  return 0;
 }

polynominal_interpolation.h

@@ -1,42 +1,37 @@
 #ifndef POLYNOMIAL_INTERPOLATION_H
 #define POLYNOMIAL_INTERPOLATION_H
 
+#include <stdio.h>
+#include <stdlib.h>
+
 /*
  Utils
 */
-
+double fabs(double x);
-int min(int a, int b);
-int max(int a, int b);
-
-/*
- Array utils
-*/
-
-typedef struct
-{
-    int size;
-    double *p;
-} arr;
-
-arr *init(int n);
-arr *resize(arr *a, int new_size);
-int convert_addr(arr *a, int pos);
-double get(arr *a, int pos);
-void set(arr *a, int pos, double val);
-arr *add(arr *a, arr *b);
-arr *mult(arr *a, double mul);
-void printa(arr *a, int q);
-arr *arr_without_el(arr *a, int ex_pos);
-arr *reverse(arr *a);
 
 /*
  Business logic
 */
 
-int has_comb(int *arr, int n, int k);
+double div_diff(double *y, double *x, unsigned int i, unsigned int d);
-int mult_by_index(arr *a, int *coords, int n);
+double *div_diff_es(double *x, double *y, unsigned int n);
-int sum_of_mult_of_n_combinations(arr *a, int n);
+
-int compose_denominator(arr *a, int pos);
+/*
-arr *compose_interpolation_polynomial(arr *xes, arr *ys);
+ User interface
+*/
+
+unsigned int insert_n();
+void print_newton_poly(double *f, double *x, unsigned int n);
+void insert_coords(double *x, double *y, unsigned int n);
+void print_array(double *arr, unsigned int n);
+void print_poly(double *coef, unsigned int n);
+
+/*
+ Coeficients of simplified polynomial computation
+*/
+
+void simplify_polynomial(double *res, double *rev_el_coef, double *x, unsigned int n);
+double compute_sum_of_multiplications_of_k(double *x, unsigned int k, unsigned int n);
+double mult_by_indexes(double *arr, unsigned int *indexes, unsigned int size);
 
 #endif