Find the GCD of two numbers

Using For Loop

#include<stdio.h>
int main(){
    int x,y,m,i;
    do
    {
        printf("Enter two number: ");
        scanf("%d%d",&x,&y);
        if(x==0 || y==0)
          printf("Please check the input and try again...\n");
    }while(x==0 || y==0);
    if(x>y)
         m=y;
    else
         m=x;

    for(i=m;i>=1;i--){
         if(x%i==0&&y%i==0){
             printf("\nGCD of %d and %d is %d",x,y,i) ;
             break;
         }
    }
    return 0;
}

Using Recursion

#include <stdio.h>

int gcd(int a, int b)
{

    if (a == b)
        return a;
    if (a > b)
        return gcd(a-b, b);
    return gcd(a, b-a);
}

int main()
{
    int x,y,m,i;
    do
    {
        printf("Enter two number: ");
        scanf("%d%d",&x,&y);
        if(x==0 || y==0)
          printf("Please check the input and try again...\n");
    }while(x==0 || y==0);
    printf("GCD of %d and %d is %d ", x, y, gcd(x, y));
    return 0;
}

   

Output
Enter two number: 0 99
Please check the input and try again...
Enter two number: 99 121

GCD of 99 and 121 is 11

Read More

Find the Factorial of a number

Summary: Factorial is represented using '!', so five factorial will be written as (5!),n factorial as (n!).
n! = n*(n-1)*(n-2)*(n-3)...3.2.1 and zero factorial is defined as one i.e. 0! = 1.



Using While Loop

#include<stdio.h>
void main()
{
    int a,f,i;
    printf("Enter a number: ");
    scanf("%d",&a);
    f=1;
    i=1;
    while(i<=a)
    {
        f = f * i;
        i++;
    }
     printf("\nFactorial of %d is: %d",a,f);
}

Using For Loop

#include<stdio.h>
void main()
{
    int a,f,i;
    printf("Enter a number: ");
    scanf("%d",&a);
    f=1;
    for(i=1;i<=a;i++)
        f = f * i;
     printf("\nFactorial of %d is: %d",a,f);
}

Using Recursion

#include<stdio.h>
int fact(int);
int main(){
 int num,f;

 printf("\nEnter a number: ");
 scanf("%d",&num);

 f=fact(num);

 printf("\nFactorial of %d is: %d",num,f);
 return 0;
}

int fact(int n){
 if(n==1)
  return 1;
 else
  return(n*fact(n-1));
}

   

Output

Enter a number: 5

Factorial of 5 is: 120

Read More

Binary Search using Recursion

#include<stdio.h>

void bins(int lb,int ub,int item,int a[]);
void main()
 {
    int i,n,item,a[20];
    printf("Enter the size of an array: ");
    scanf("%d",&n);

    printf("Enter the elements of the array: " );
    for(i=0;i<n;i++)
        {
         scanf("%d",&a[i]);
        }

    printf("Enter the number to be search: ");
    scanf("%d",&item);


    bins(0,n-1,item,a);

 }

void bins(int lb,int ub,int item,int a[])
{
     int mid,flag=0;

     if(lb<=ub)
        {
          mid=(lb+ub)/2;
          if(item==a[mid])
            {
              flag=flag+1;
            }
          else if(item<a[mid])
          {
              return bins(lb,mid-1,item,a);
          }
          else
              return bins(mid+1,ub,item,a);
        }


       if(flag==0)
         printf("Number is not found.");
       else
         printf("Number is found at %d", mid+1);
}

   

Output
Enter the size of an array: 6
Enter the elements of the array: 90 95 1000 1001 1003 1006
Enter the number to be search: 95
Number is found at 2

Read More