ATM Transaction program code using C

    /*
     * C Program to Display the ATM Transaction
     */
    #include <stdio.h>
     unsigned long amount=1000, deposit, withdraw;
    int choice, pin, k;
    char transaction ='y';

    void main()
    {
        while (pin != 5005)
        {
            printf("ENTER YOUR SECRET PIN NUMBER:");
            scanf("%d", &pin);
            if (pin != 5005)
            printf("PLEASE ENTER VALID PASSWORD\n");
        }

        do
        {
            printf("********Welcome to ATM Service**************\n");
            printf("1. Check Balance\n");
            printf("2. Withdraw Cash\n");
            printf("3. Deposit Cash\n");
            printf("4. Quit\n");
            printf("*******************************************\n\n");
            printf("Enter your choice: ");
            scanf("%d", &choice);
            switch (choice)
            {
            case 1:
                printf("\n YOUR BALANCE IN Rs : %lu ", amount);
                break;
            case 2:
                printf("\n ENTER THE AMOUNT TO WITHDRAW: ");
                scanf("%lu", &withdraw);
                if (withdraw % 100 != 0)
                {
                    printf("\n PLEASE ENTER THE AMOUNT IN MULTIPLES OF 100");
                }
                else if (withdraw >(amount - 500))
                {
                    printf("\n INSUFFICENT BALANCE");
                }
                else
                {
                    amount = amount - withdraw;
                    printf("\n\n PLEASE COLLECT CASH");
                    printf("\n YOUR CURRENT BALANCE IS%lu", amount);
                }
                break;
            case 3:
                printf("\n ENTER THE AMOUNT TO DEPOSIT");
                scanf("%lu", &deposit);
                            amount = amount + deposit;
                printf("YOUR BALANCE IS %lu", amount);
                break;
            case 4:
                printf("\n THANK U USING ATM");
                break;
            default:
                printf("\n INVALID CHOICE");
            }
            printf("\n\n\n DO U WISH TO HAVE ANOTHER TRANSCATION?(y/n): \n");
            fflush(stdin);
            scanf("%c", &transaction);
            if (transaction == 'n'|| transaction == 'N')
                        k = 1;
        } while (!k);
        printf("\n\n THANKS FOR USING OUT ATM SERVICE");
    }

Binary Search using C

//Program for Binary Search
#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],flag=0,i,n,top,mid,bottom,key;
clrscr();
printf("\nEnter size of the array:");
scanf("%d",&n);
printf("\nEnter elements into the array in sorted order:");
for(i=0;i<n;i++)
 scanf("%d",&a[i]);
printf("\nEnter element to be searched:");
scanf("%d",&key);
top = 0;
bottom = n-1;
while(top <= bottom && flag == 0)
 {
  mid = (top + bottom) /2 ;
  if(a[mid] == key)
  flag = 1;
else if(key>a[mid])
  top = mid + 1;
else
  bottom = mid - 1;
}
if(flag == 1)
  printf("\nSearch element %d found at position %d",key,mid+1);
else
  printf("\nSearch element %d is not found.",key);
}

Linear Search program in C

//program for linear search
#include<stdio.h>
void main()
{
int a[10],n,i,search,flag=0;
clrscr();
printf("How many numbers:");
scanf("%d",&n);
printf("\nEnter the numbers :");
for(i=0;i<n;i++)
 scanf("%d",&a[i]);
printf("\nEnter the element to be searched:");
scanf("%d",&search); //reading search element
 for(i=0;i<n;i++)
 {
  if(a[i]==search) // comparing search element to the
   { //element in the array list.
     flag=1;
     break; //if element is found make flag=1
   }
 }
 if(flag==1) //if flag=1 it means element found
  printf("\nElement found at position %d",i+1);
 else //i+! is the element position
  printf("\nElement Not Found");
getch();
}

Bubble Sort program code using C language

//Program for Bubble Sort
#include<stdio.h>
void main()
{
int a[10],n,i,j,t;
clrscr();
printf("How many numbers:");
scanf("%d",&n);
printf("Enter the numbers :");
for(i=0;i<n;i++)
 scanf("%d",&a[i]);
printf("The sorted list ...");
 for(i=0;i<n-1;i++) //for ‘n’ elements n-1 passes
 {
  for(j=0;j<n-1-i;j++) //and each time n-1-I comparisons
  {
   if(a[j]>a[j+1])
    {
    t=a[j];
    a[j]=a[j+1];
    a[j+1]=t;
    }
  }
 }
for(i=0;i<n;i++)
 printf("\n\t\t%d",a[i]);
getch();
}