Algorithams on Design Analysis and Algoritham -DAA

 →problem:- Given a number m, devise an algorithm to find its square root

#include<stdio.h>

#include<conio.h>

void main()

{

float m,n,g1,g2;

clrscr();

printf("\n Enter Number :");

scanf("%f",&m);

g2=m/g2;

do

{

g1=g2;

g2=(g1+(m/g1))/2;

if((g2*g2)==m)

{

printf("\n Square root Of %f is %f ",m,g2);

break;

}

else

{

n=g1-g2

}

}while(n!=0.0001)

getch();

}

→program of smallest divisor

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

void main()
{
    int n,d=3;
    float r;

    printf("Enter value of N:- ");
    scanf("%d",&n);

    if(n%2==0)  //even
    {
        printf("Smallest divisor is 2");
    }
    else
    {
        r=sqrt(n);
        while(d<=r)
        {
            if(n%d==0)
            {
                printf("smallest divisor is %d",d);
                return;
            }
            else
            {
                d=d+2;
            }
        }
        printf("no is prime number....");
    }
    print("\n");
}