c: June 2012

Write a simple code for binary search using function recursion in c programming language

#include

int main(){

    int a[10],i,n,m,c,l,u;

    printf("Enter the size of an array: ");

    scanf("%d",&n);

    printf("Enter the elements of the array: " );

    for(i=0;i

         scanf("%d",&a[i]);

}

    printf("Enter the number to be search: ");

    scanf("%d",&m);

    l=0,u=n-1;

    c=binary(a,n,m,l,u);

    if(c==0)

         printf("Number is not found.");

    else

         printf("Number is found.");

    return 0;

}

int binary(int a[],int n,int m,int l,int u){

     int mid,c=0;

     if(l<=u){

          mid=(l+u)/2;

          if(m==a[mid]){

              c=1;

}

          else if(m

              return binary(a,n,m,l,mid-1);

}

          else

              return binary(a,n,m,mid+1,u);

}

     else

       return c;

}

Sample output:

Enter the size of an array: 5

Enter the elements of the array: 8 9 10 11 12

Enter the number to be search: 8

Number is found.

1. Write a simple code for binary search in c programming language

2. Wap a c program to search an element in an array using binary search

#include

int main(){

    int a[10],i,n,m,c=0,l,u,mid;

    printf("Enter the size of an array: ");

    scanf("%d",&n);

    printf("Enter the elements in ascending order: ");

    for(i=0;i

         scanf("%d",&a[i]);

}

    printf("Enter the number to be search: ");

    scanf("%d",&m);

    l=0,u=n-1;

    while(l<=u){

         mid=(l+u)/2;

         if(m==a[mid]){

             c=1;

             break;

}

         else if(m

             u=mid-1;

}

         else

             l=mid+1;

}

    if(c==0)

         printf("The number is not found.");

    else

         printf("The number is found.");

    return 0;

}

Sample output:

Enter the size of an array: 5

Enter the elements in ascending order: 4 7 8 11 21

Enter the number to be search: 11

The number is found.

1. Write a simple code for linear search in c programming language

2. Wap a c program to search an element in an array using linear search

#include

int main(){

    int a[10],i,n,m,c=0;

    printf("Enter the size of an array: ");

    scanf("%d",&n);

    printf("Enter the elements of the array: ");

    for(i=0;i<=n-1;i++){

         scanf("%d",&a[i]);

}

    printf("Enter the number to be search: ");

    scanf("%d",&m);

    for(i=0;i<=n-1;i++){

         if(a[i]==m){

             c=1;

             break;

}

}

    if(c==0)

         printf("The number is not in the list");

    else

         printf("The number is found");

    return 0;

}

Sample output:

Enter the size of an array: 5

Enter the elements of the array: 4 6 8 0 3

Enter the number to be search: 0

The number is found

Source code of simple Selection sort implementation using array ascending order in c programming language

#include<stdio.h>

int main(){

  int s,i,j,temp,a[20];

  printf("Enter total elements: ");

  scanf("%d",&s);

  printf("Enter %d elements: ",s);

  for(i=0;i<s;i++)

      scanf("%d",&a[i]);

  for(i=0;i<s;i++){

      for(j=i+1;j<s;j++){

           if(a[i]>a[j]){

               temp=a[i];

              a[i]=a[j];

              a[j]=temp;

}

}

}

  printf("After sorting is: ");

  for(i=0;i<s;i++)

      printf(" %d",a[i]);

  return 0;

}

Output:

Enter total elements: 5

Enter 5 elements: 4 5 0 21 7

The array after sorting is:  0 4 5 7 21

Source code of simple merge sort implementation using array in ascending order in c programming language

#include<stdio.h>

#define MAX 50

void mergeSort(int arr[],int low,int mid,int high);

void partition(int arr[],int low,int high);

int main(){

    int merge[MAX],i,n;

    printf("Enter the total number of elements: ");

    scanf("%d",&n);

    printf("Enter the elements which to be sort: ");

    for(i=0;i<n;i++){

         scanf("%d",&merge[i]);

}

    partition(merge,0,n-1);

    printf("After merge sorting elements are: ");

    for(i=0;i<n;i++){

         printf("%d ",merge[i]);

}

   return 0;

}

void partition(int arr[],int low,int high){

    int mid;

    if(low<high){

         mid=(low+high)/2;

         partition(arr,low,mid);

         partition(arr,mid+1,high);

         mergeSort(arr,low,mid,high);

}

}

void mergeSort(int arr[],int low,int mid,int high){

    int i,m,k,l,temp[MAX];

    l=low;

    i=low;

    m=mid+1;

    while((l<=mid)&&(m<=high)){

         if(arr[l]<=arr[m]){

             temp[i]=arr[l];

             l++;

}

         else{

             temp[i]=arr[m];

             m++;

}

         i++;

}

    if(l>mid){

         for(k=m;k<=high;k++){

             temp[i]=arr[k];

             i++;

}

}

    else{

         for(k=l;k<=mid;k++){

             temp[i]=arr[k];

             i++;

}

}

    for(k=low;k<=high;k++){

         arr[k]=temp[k];

}

}

Sample output:

Enter the total number of elements: 5

Enter the elements which to be sort: 2 5 0 9 1

After merge sorting elements are: 0 1 2 5 9

Source code of simple bubble sort implementation using array ascending order in c programming language

#include<stdio.h>

int main(){

  int s,temp,i,j,a[20];

  printf("Enter total numbers of elements: ");

  scanf("%d",&s);

  printf("Enter %d elements: ",s);

  for(i=0;i<s;i++)

      scanf("%d",&a[i]);

  //Bubble sorting algorithm

  for(i=s-2;i>=0;i--){

      for(j=0;j<=i;j++){

           if(a[j]>a[j+1]){

               temp=a[j];

              a[j]=a[j+1];

              a[j+1]=temp;

}

}

}

  printf("After sorting: ");

  for(i=0;i<s;i++)

      printf(" %d",a[i]);

  return 0;

}

Output:

Enter total numbers of elements: 5

Enter 5 elements: 6 2 0 11 9

After sorting:  0 2 6 9 11

Pages