Professional Documents
Culture Documents
Division Algorithm
Division Algorithm
Programme:
#include<stdio.h>
void main ()
mc[i] = !m[i];
a[i] = 0, x[i] = 0;
z = c;
mc[i] = s[i];
{
printf (" %d", q[i]);
a[1] = q[4];
if (a[5] == 0)
z = 0;
a[i] = s[i];
if (a[5] == 1)
q[1] = 0;
else
q[1] = 1;
}
printf ("\t ");
else
z = 0;
z = c;
a[i] = s[i];
}
if (a[5] == 1)
q[1] = 0;
else
q[1] = 1;
if (a[5] == 1)
z = c;
a[i] = s[i];
}
printf ("\t\t a = a+m\t\t ");
}
printf ("\n\n\n\nRemainder [A] :");
#include<stdio.h>
void main ()
mc[i] = !m[i];
a[i] = 0, x[i] = 0;
z = c;
mc[i] = s[i];
a[1] = q[4];
if (a[5] == 0)
z = 0;
z = c;
a[i] = s[i];
if (a[5] == 1)
q[1] = 0;
else
q[1] = 1;
else
z = 0;
z = c;
a[i] = s[i];
if (a[5] == 1)
q[1] = 0;
else
q[1] = 1;
{
printf (" %d", a[i]);
if (a[5] == 1)
a[i] = s[i];
#include<stdio.h>
void main ()
mc[i] = !m[i];
a[i] = 0, x[i] = 0;
z = c;
mc[i] = s[i];
a[1] = q[4];
}
if (a[5] == 0)
z = 0;
z = c;
a[i] = s[i];
if (a[5] == 1)
q[1] = 0;
else
{
q[1] = 1;
else
{
z = 0;
z = c;
a[i] = s[i];
if (a[5] == 1)
q[1] = 0;
else
q[1] = 1;
}
printf ("\n\n\t\t a = a+m\t\t ");
if (a[5] == 1)
z = c;
a[i] = s[i];