Q.7 Consider the Peasants' Algorithm for multiplication of two positive integers. It
works in the following manner:
• Write the two numbers in two columns. Keep updating according to the
following procedure until the number in the first (i.e., left) column becomes 1.
• Halve the number in the first column (integer division), double the number in
the second column.
• In the end, sum up all the numbers in the second column, for which, the
corresponding number in the first column is odd.
Example of multiplication using Peasants’ algorithm: 13 x 8:
13 8 ←
6 16
3 32 ←
1 64 ←
Answer: 64 + 32 + 8 = 104
Write a function to calculate multiplication using the Peasants’
algorithm.

Code:

#include<stdio.h>
int main()
{
    int n1,n2,c1,c2,sum=0;
    printf("Enter two numbers: ");
    scanf("%d%d",&n1,&n2);
    c1=n1;c2=n2;
    while(c1>=1)
    {
        if(c1%2==1)
            sum+=c2;
        c1/=2;c2*=2;
    }
    printf("The product of %d and %d is %d",n1,n2,sum);
}
Do go through this, And thank you for constructive criticism.