C codes based on Divide and Conquer.

Divide and Conquer/Fibonacci.c

@@ -0,0 +1,80 @@
+#include <stdio.h>
+
+long long m[2][2];
+long long ans[2][2];
+void mul();
+void poww();
+
+void mul(void)
+{
+    long long a[2][2] = {{1, 1}, {1, 0}};
+    long long b[2][2] = {0};
+    for (int i = 0; i < 2; i++)
+    {
+        for (int j = 0; j < 2; j++)
+        {
+            for (int k = 0; k < 2; k++)
+            {
+                b[i][j] += ((ans[i][k])*(m[k][j]));
+            }
+        }
+    }
+    ans[0][0] = b[0][0];
+    ans[0][1] = b[0][1];
+    ans[1][0] = b[1][0];
+    ans[1][1] = b[1][1];
+}
+
+void poww(void)
+{
+    long long b[2][2] = {0};
+    for (int i = 0; i < 2; i++)
+    {
+        for (int j = 0; j < 2; j++)
+        {
+            for (int k = 0; k < 2; k++)
+            {
+                b[i][j] += ((m[i][k])* (m[k][j]));
+            }
+        }
+    }
+    m[0][0] = b[0][0];
+    m[0][1] = b[0][1];
+    m[1][0] = b[1][0];
+    m[1][1] = b[1][1];
+}
+int main()
+{
+    int T;
+    scanf("%d", &T);
+    while (T--)
+    {
+        long long n;
+        scanf("%lld", &n);
+        m[0][0] = 1;
+        m[0][1] = 1;
+        m[1][0] = 1;
+        m[1][1] = 0;
+        ans[0][0] = 1;
+        ans[0][1] = 1;
+        ans[1][0] = 1;
+        ans[1][1] = 0;
+        if (n == 0)
+            printf("0\n");
+        else if (n == 1)
+            printf("1\n");
+        else
+        {
+            while (n > 0)
+            {
+                if (n & 1 == 1)
+                    mul();
+                n = n >> 1;
+                poww();
+            }
+
+            printf("%lld\n", ans[1][1]);
+        }
+    }
+    return 0;
+}

Divide and Conquer/SquareRoot.c

@@ -0,0 +1,32 @@
+#inlcude<math.h>
+#include<stdio.h>
+#define PR 0.0000001
+int main(void)
+{
+  float n,ans,l,r,mid;
+  printf("Please enter a positive number!");
+  scanf("%f",&n);
+  if(n>1)
+  {
+     l =1,r=n;
+     mid = (l+r)/2;   
+     while(fabs(mid*mid-n)>PR)
+     {
+          ((mid*mid-n)>0)?r=mid:l=mid;
+     }
+      ans=mid;
+  }
+  else
+  {
+
+     l =1,r=n;
+     mid = (l+r)/2;   
+     while(fabs(mid*mid-n)>PR)
+     {
+          ((mid*mid-n)>0)?l=mid:r=mid;
+     }
+      ans=mid;
+  }
+  printf("The square root of %f is %f\n",n,ans);
+  return 0;
+}