searching of data

the program is

#include<stdio.h>
#define MAX 10
int main()
{
int ab[MAX],i,n,search;
printf("enter the no of element");
scanf("%d",&n);
printf("enter the no");
for(i=0;i<n;i++)
{
scanf("%d",&ab[i]);
}
printf("enter the search element\n");
scanf("%d",&search);
for(i=0;i<n;i++)
{
if(search==ab[i])
{
printf("Elemnt is %d found at location %d\n",search,i+1);
break;
}
}
if(i==n)
printf("enter the element not found");
getch();
return 0;
}

the output is

sorting of data

the program is as follow

#include<stdio.h>
#define MAX 10
 int main()
{
int arr[MAX],i,j,n,temp;
printf("Enter the no of element ");
scanf("%d",&n);
printf("enter the no:");
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
{
if(arr[i]>arr[j])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
printf("sorted no of ascending order :\n");
for(i=0;i<n;i++)
{
printf("%5d",arr[i]);
}
getch();
return 0;
}

the output is

Linear searching

#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,j,n,temp;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     //sorting
     for(i=0;i<n-1;i++)
     for(j=i+1;j<n;j++)
     {
     if(a[i]>a[j])
     {               
         temp=a[i];
         a[i]=a[j];
         a[j]=temp;
     }
     }
     printf("sorted elements in ascending order:\n");
     for(i=0;i<n;i++)
     {
        printf("%5d",a[i]);
     }
     getch();
     return 0;
}        
   

Bubblesort program

#include<stdio.h>
int main()
{
    int a[10],i,n,pass,tmp=0;
    printf("\n Enter the size of the array:");
    scanf("%d",&n);
    printf("\n Enter the elements of the array:\n");
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    pass=1;
    while(pass<n)
    {
        for(i=0;i<n-pass;i++)
        {
            if(a[i]>a[i+1])
            {
                tmp=a[i];
                a[i]=a[i+1];
                a[i+1]=tmp;
            }
        }
        pass=pass+1;
    }
    printf("\n The sorted array in ascending order is as follows:\n");
    for(i=0;i<n;i++)
    {
        printf("%d \n",a[i]);
    }
    return 0;
}

binary tree

#include<stdio.h>
typedef struct link
{
    struct link *left;
    int data;
    struct link *right;
}node;
node *tree=NULL;
node *insert(node*,int);
int main()
{
    int val;
    printf("\n Enter the data:");
    scanf("%d",&val);
    tree=insert(tree,val);
    int search();
    return 0;
}
node *insert(node *tree,int val)
{
    if(tree==NULL)
    {
        tree=(node*)malloc(sizeof(node));
        tree->data=val;
        tree->left=tree->right=NULL;
    }
        else if(val>tree->data)
        {
            tree->right=insert(tree->right,val);
        }
        else if(val<tree->data)
        {
            tree->left=insert(tree->left,val);
        }
        else
        {
            printf("\n Duplicate value");
        }
        return(tree);
}
void search(node *tree,int v)
{
    if(tree==NULL)
    {
        printf("\n Search successful");
        return;
    }
    else if(tree->data==v)
    {
        printf("\n Search successful");
        return;
    }
    else if(v>tree->data)
    {
        search(tree->right,v);
    }
    else
    {
        search(tree->left,v);
    }
}

# include <stdio.h>
# include <conio.h>
# include <stdlib.h>

typedef struct BST {
   int data;
   struct BST *lchild, *rchild;
} node;

void insert(node *, node *);
void inorder(node *);
void preorder(node *);
void postorder(node *);
node *search(node *, int, node **);

void main() {
   int choice;
   char ans = 'N';
   int key;
   node *new_node, *root, *tmp, *parent;
   node *get_node();
   root = NULL;


   printf("\nProgram For Binary Search Tree ");
   do {
      printf("\n1.Create");
      printf("\n2.Search");
      printf("\n3.Recursive Traversals");
      printf("\n4.Exit");
      printf("\nEnter your choice :");
      scanf("%d", &choice);

      switch (choice) {
      case 1:
         do {
            new_node = get_node();
            printf("\nEnter The Element ");
            scanf("%d", &new_node->data);

            if (root == NULL) /* Tree is not Created */
               root = new_node;
            else
               insert(root, new_node);

            printf("\nWant To enter More Elements?(y/n)");
            ans = getch();
         } while (ans == 'y');
         break;

      case 2:
         printf("\nEnter Element to be searched :");
         scanf("%d", &key);

         tmp = search(root, key, &parent);
         printf("\nParent of node %d is %d", tmp->data, parent->data);
         break;

      case 3:
         if (root == NULL)
            printf("Tree Is Not Created");
         else {
            printf("\nThe Inorder display : ");
            inorder(root);
            printf("\nThe Preorder display : ");
            preorder(root);
            printf("\nThe Postorder display : ");
            postorder(root);
         }
         break;
      }
   } while (choice != 4);
}
/*
 Get new Node
 */
node *get_node() {
   node *temp;
   temp = (node *) malloc(sizeof(node));
   temp->lchild = NULL;
   temp->rchild = NULL;
   return temp;
}
/*
 This function is for creating a binary search tree
 */
void insert(node *root, node *new_node) {
   if (new_node->data < root->data) {
      if (root->lchild == NULL)
         root->lchild = new_node;
      else
         insert(root->lchild, new_node);
   }

   if (new_node->data > root->data) {
      if (root->rchild == NULL)
         root->rchild = new_node;
      else
         insert(root->rchild, new_node);
   }
}
/*
 This function is for searching the node from
 binary Search Tree
 */
node *search(node *root, int key, node **parent) {
   node *temp;
   temp = root;
   while (temp != NULL) {
      if (temp->data == key) {
         printf("\nThe %d Element is Present", temp->data);
         return temp;
      }
      *parent = temp;

      if (temp->data > key)
         temp = temp->lchild;
      else
         temp = temp->rchild;
   }
   return NULL;
}
/*
 This function displays the tree in inorder fashion
 */
void inorder(node *temp) {
   if (temp != NULL) {
      inorder(temp->lchild);
      printf("%d", temp->data);
      inorder(temp->rchild);
   }
}
/*
 This function displays the tree in preorder fashion
 */
void preorder(node *temp) {
   if (temp != NULL) {
      printf("%d", temp->data);
      preorder(temp->lchild);
      preorder(temp->rchild);
   }
}

/*
 This function displays the tree in postorder fashion
 */
void postorder(node *temp) {
   if (temp != NULL) {
      postorder(temp->lchild);
      postorder(temp->rchild);
      printf("%d", temp->data);
   }
}

HASHING

#include<stdio.h>
 #include<stdbool.h>
 int pos;
 int array[50];
 void insert();
 void search();
 int Hash(int );
 int reHash(int );
 void Delete();
 int main()
   {
     int choice;
     int i;
     for(i = 0; i < 40; i++){
         array[i] = '*';
     while(1)
     {
         printf("\n1. Insert\n2. Search\n3. Delete\n4. Exit\n");
         printf("Enter your choice: ");
         scanf("%d", &choice);
         switch(choice){
             case 1:
                 insert();
                 break;
             case 2:
                 search();
                 break;
             case 3:
                 Delete();
                 break;
             case 4:
                 exit(0);
             default:
                 printf("\nEnter correct option\n");
                 break;
         }
     }
     return 0;
 }

void insert(){
     int data;
     int count = 0;
     printf("Enter the item to insert: ");
     scanf("%d", &data);
     pos = Hash(data);
     if(pos >= 50)
     {
         pos = 0;
     }
     while(array[pos] != '*'){
         pos = reHash(pos);
         count++;
         if(count>=50){
             printf("Memory Full!!No space is avaible for storage");
             break;
         }
     }
     if(array[pos] == '*'){
         array[pos] = data;
     }
     printf("Data is stored at index %d\n", pos);
 }
 int Hash(int k){
     return k%100;
 }
 int reHash(int k){
     return (k+1)%100;
 }
 void search(){
     int k,i;
     bool isFound = false;
     printf("Enter the item to search: ");
     scanf("%d", &k);
     for(i = 0; i < 50; i++){
         if(array[i] == k)
         {
             isFound = true;
             break;
         }
     }
     if(isFound)
     {
         printf("The item is found at index %d\n", i);
     }
     else
     {
         printf("No record available!!");
     }
 }
 void Delete(){
     int k,i;
     bool isFound = false;
     printf("Enter the item to delete: ");
     scanf("%d", &k);
     for(i = 0; i < 50; i++){
         if(array[i] == k){
             isFound = true;
             break;
         }
     }
     if(isFound)
     {
         array[i] = '*';
         printf("The item is deleted\n");
     }
     else
     {
         printf("No item is Found!!");
     }
 }

 

Bubble Sort

#include<stdio.h>
#include<conio.h>
void main()
{
int a[50],n,i,j,temp=0;
printf("Enter how many numbers you want:\n");
scanf("%d",&n);
printf("Enter the %d elements:\n",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\n\t\tThe given array is:\n");
for(i=0;i<n;i++)
{
printf("\n\t\t%d",a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}

printf("\n\n\n\t\tThe sorted array using Buble sort is:\n");
for(i=0;i<n;i++)
{
printf("\n\t\t%d",a[i]);
}
}

Binary Search

#include<stdio.h>
#include<conio.h>
void main()
{
int a[100],b,i,j,mid,top,bottom,n;
printf("Enter how many elements you want:\n");
scanf("%d",&n);
printf("Enter the %d elements in ascending order\n",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\nEnter the b to  search\n");
scanf("%d",&b);
bottom=1;
top=n;
do
{
mid=(bottom+top)/2;
if(b<a[mid])
{
top=mid-1;
}
else if(b>a[mid])
{
bottom=mid+1;
}
}while(b!=a[mid]&&bottom<=top);
if(b==a[mid])
{
printf("Binary search successfull!!\n");
printf("\n %d found in position: %d\n",b,mid+1);
}
else
{
printf("\n  Search failed\n %d not found\n",b);
}
}

bubble sort

#include<stdio.h>
int main()
{
    int a[10],i,n,pass,tmp=0;
    printf("\n Enter the size of the array:");
    scanf("%d",&n);
    printf("\n Enter the elements of the array:\n");
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    pass=1;
    while(pass<n)
    {
        for(i=0;i<n-pass;i++)
        {
            if(a[i]>a[i+1])
            {
                tmp=a[i];
                a[i]=a[i+1];
                a[i+1]=tmp;
            }
        }
        pass=pass+1;
    }
    printf("\n The sorted array in ascending order is as follows:\n");
    for(i=0;i<n;i++)
    {
        printf("%d \n",a[i]);
    }
    return 0;
}

sorting

#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,j,n,temp;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     //sorting
     for(i=0;i<n-1;i++)
     for(j=i+1;j<n;j++)
     {
     if(a[i]>a[j])
     {              
         temp=a[i];
         a[i]=a[j];
         a[j]=temp;
     }
     }
     printf("sorted elements in ascending order:\n");
     for(i=0;i<n;i++)
     {
        printf("%5d",a[i]);
     }
     getch();
     return 0;
}       
   

linear search

#include<stdio.h>
int main()
{
    int list[100],n,i,x,p,found=0;
    printf("\n Enter the size of the list:");    //entering the size of the array
    scanf("%d",&n);
    printf("\n Enter the elements:\n");        //entering the elements of the array
    for(i=0;i<n;i++)
    {
        scanf("%d",&list[i]);
    }
    p=0;
    printf("\n Enter the element to be searched:");        //entering the KEY element to be searched
    scanf("%d",&x);
    for(i=0;i<n;i++)
    {
        if(list[i]==x)        //if KEY element is found then
        {                   
            p=i;        //store the index value of the array in another variable
            found=1;           
        }
    }
        if(found>0)
        {
            printf("\n The position of element %d is %d",x,p+1);        //print the KEY element along with its position in the array
        }
        else
        {
            printf("\n Try Again");       
        }
    return 0;        //end of program
}

//sorting array
#include <stdio.h>
sorting;------------------



int main()
{
  int arr[20], n, i, j, temp;

  printf("Enter number of elements\n");
  scanf("%d", &n);

  printf("Enter %d integers\n", n);

  for (i=0;i<n;i++)
    scanf("%d", &arr[i]);

  for (i = 0 ;i<(n- 1); i++)
  {
    for (j = 0 ; j <n-i - 1; j++)
    {
      if (arr[j] > arr[j+1])
      {
        temp     = arr[j];
        arr[j]   = arr[j+1];
        arr[j+1] = temp;
      }
    }
  }

  printf("Sorted list in ascending order:\n");

  for ( i = 0 ; i <n ; i++ )
     printf("%d\n", arr[i]);

  getch();
  return 0;
}

  out put

sorting

//selection sort
#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,j,n,temp;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     //sorting
     for(i=0;i<n-1;i++)
     for(j=i+1;j<n;j++)
     {
     if(a[i]>a[j])
     {              
         temp=a[i];
         a[i]=a[j];
         a[j]=temp;
     }
     }
     printf("sorted elements in ascending order:\n");
     for(i=0;i<n;i++)
     {
        printf("%5d",a[i]);
     }
     getch();
     return 0;
}        

linear search

#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,search,n;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     printf("enter element to be searched\n");
     scanf("%d",&search);
     for(i=0;i<n;i++)
     {
     if(search==a[i])
     {
       printf("element %d found at location %d\n",search,i+1);
      break;
     }
     }
     if(i==n)
      printf("searched element %d is  not found in the array",search);
   getch();
   return 0;
}           

Hashing prog........:---------



#include<stdio.h>
#include<stdbool.h>
#include<conio.h>
int hash_pos;
int array[40];
//declaring user defined functions
void insert();
void search();
int Hash(int );
int reHash(int );
void Delete();

void insert(){
    int data;
    int count = 0;
    printf("Enter the data to insert: ");
    scanf("%d", &data);
    hash_pos = Hash(data);
    if(hash_pos >= 40){
        hash_pos = 0;
    }
    while(array[hash_pos] != '*'){
        hash_pos = reHash(hash_pos);
        count++;
        if(count>=40){
            printf("Memory Full!!No space is avaible for storage");
            break;
        }
    }
    if(array[hash_pos] == '*'){
        array[hash_pos] = data;
    }
    printf("Data is stored at index %d\n", hash_pos);
}
int Hash(int key){
    return key%100;
}
int reHash(int key){
    return (key+1)%100;
}
void search(){
    int key,i;
    bool isFound = false;
    printf("Enter the key to search: ");
    scanf("%d", &key);
    for(i = 0; i < 40; i++){
        if(array[i] == key){
            isFound = true;
            break;
        }
    }
    if(isFound){
        printf("The key is found at index %d\n", i);
    }else{
        printf("No record found!!\n");
    }
}
void Delete(){
    int key,i;
    bool isFound = false;
    printf("Enter the key to delete: ");
    scanf("%d", &key);
    for(i = 0; i < 40; i++){
        if(array[i] == key){
            isFound = true;
            break;
        }
    }
    if(isFound){
        array[i] = '*';
        printf("The key is deleted\n");
    }else{
        printf("No key is Found!!");
    }
}
int main(){
    int choice;
    int i;
    for(i = 0; i < 40; i++){
        array[i] = '*';
    }
    while(1){
        printf("\n1. Insert\n2. Search\n3. Delete\n4. Exit\n");
        printf("Enter your choice: ");
        scanf("%d", &choice);
        switch(choice){
            case 1:
                insert();
                break;
            case 2:
                search();
                break;
            case 3:
                Delete();
                break;
           // case 4:
             //   exit();
            default:
                printf("\nEnter correct option\n");
                break;
        }
    }
    return 0;
}


OUT PUT:----------

//binary search
#include <stdio.h>

int main()
{
   int i, first, last, middle, n, search, array[100];

   printf("Enter number of elements\n");
   scanf("%d",&n);

   printf("Enter %d elements\n", n);

   for ( i= 0 ; i< n ; i++ )
      scanf("%d",&array[i]);

   printf("Enter value to search\n");
   scanf("%d",&search);

   first = 0;
   last = n - 1;
   middle = (first+last)/2;

   while( first <= last )
   {
      if ( array[middle] < search )
         first = middle + 1;  
      else if ( array[middle] == search )
      {
         printf("%d found at location %d.\n", search, middle+1);
         break;
      }
      else
         last = middle - 1;

      middle = (first + last)/2;
   }
   if ( first > last )
      printf("Not found! %d is not present in the list.\n", search);

   return 0;  
}




Ouput
Enter number of elements
8
Enter 8 integers
74
41
12
23
36
69
98
85
Enter value to find
69
69 found at location 6.

//linear search
#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,search,n;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     printf("enter element to be searched\n");
     scanf("%d",&search);
     for(i=0;i<n;i++)
     {
     if(search==a[i])
     {
       printf("element %d found at location %d\n",search,i+1);
       break;
     }
     }
     if(i==n)
      printf("searched element not found");
   getch();
   return 0;
}    

Search element in an Array through Bubble sort technic.

Search element in an Array through Bubble sort technic.

#include<stdio.h>
#include<conio.h>
void bsort(int *num, int n);
int main()
{
    int i,num[5];
    printf("Enter 5 number-\n");
    for(i=0;i<5;i++)
    scanf("%d",&num[i]);
    bsort(num,5);
}
void bsort(int *num,int n)
{
     int i,j,t;
     for(i=0;j<n;i++)
     {
                     for(j=i;j<n-1;j++)
                     {
                                     if(num[i]<num[j+1])
                                     {
                                                        t=num[i];
                                                        num[i]=num[j+1];
                                                        num[j+1]=t;
                                                        }
                                                        }
                                                        }
                                                        printf("select element are...\n");
                                                        for(i=0;i<n;i++)
                                                        printf("%d\n",num[i]);
                                                        getch();
                                                        //return 0;
                                                        }
     // ============== Output after run on DEV C++ compiler.

                     

    

linear search in an array

#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,search,n;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     printf("enter element to be searched\n");
     scanf("%d",&search);
     for(i=0;i<n;i++)
     {
     if(search==a[i])
     {
       printf("element %d found at location %d\n",search,i+1);
      break;
     }
     }
     if(i==n)
      printf("searched element %d is  not found in the array",search);
   getch();
   return 0;
}           

selection sort in an array

#include<stdio.h>
#define MAX 20
int main()
{
     int a [MAX];
     int i,j,n,temp;
     printf("enter no. of elements:");
     scanf("%d",&n);
     printf("enter the elements\n");
     for(i=0;i<n;i++)
     {
         scanf("%d",&a[i]);
     }
     //sorting
     for(i=0;i<n-1;i++)
     for(j=i+1;j<n;j++)
     {
     if(a[i]>a[j])
     {              
         temp=a[i];
         a[i]=a[j];
         a[j]=temp;
     }
     }
     printf("sorted elements in ascending order:\n");
     for(i=0;i<n;i++)
     {
        printf("%5d",a[i]);
     }
     getch();
     return 0;
}        

/*  BINARY SEARCHING*/


#include <stdio.h>
 #include<conio.h>
int main()
{
   int c, first, last, middle, n, search, array[100];

   printf("Enter number of elements\n");
   scanf("%d",&n);

   printf("Enter %d integers\n", n);

   for ( c = 0 ; c < n ; c++ )
      scanf("%d",&array[c]);

   printf("Enter value to find\n");
   scanf("%d",&search);

   first = 0;
   last = n - 1;
   middle = (first+last)/2;

   while( first <= last )
   {
      if ( array[middle] < search )
         first = middle + 1;   
      else if ( array[middle] == search )
      {
         printf("%d found at location %d.\n", search, middle+1);
         break;
      }
      else
         last = middle - 1;

      middle = (first + last)/2;
   }
   if ( first > last )
      printf("Not found! %d is not present in the list.\n", search);
 getch();
   return 0;  
}


                                            OUTPUT

 

INSERTION :--------



#include <stdio.h>

int main()
{
  int n, array[1000], c, d, t;

  printf("Enter number of elements\n");
  scanf("%d", &n);

  printf("Enter %d integers\n", n);

  for (c = 0; c < n; c++) {
    scanf("%d", &array[c]);
  }

  for (c = 1 ; c <= n - 1; c++) {
    d = c;

    while ( d > 0 && array[d] < array[d-1]) {
      t          = array[d];
      array[d]   = array[d-1];
      array[d-1] = t;

      d--;
    }
  }

  printf("Sorted list in ascending order:\n");

  for (c = 0; c <= n - 1; c++) {
    printf("%d\n", array[c]);
  }

  return 0;
}



OUT PUT:-----

Search element in array?

Search element in array?

#include<stdio.h>
#include<conio.h>

int main() {
   int a[30], ele, num, i;

   printf("\nEnter no of elements :");
   scanf("%d", &num);

   printf("\nEnter the values :");
   for (i = 0; i < num; i++) {
      scanf("%d", &a[i]);
   }

   printf("\nEnter the elements to be searched :");
   scanf("%d", &ele);


   i = 0;
   while (i < num && ele != a[i]) {
      i++;
   }


   if (i < num) {
      printf("Number found at the location = %d", i + 1);
   } else {
      printf("Number not found");
   }
  getch();
   return (0);
 
}
//============================== output after run on DEV C++ compiler

 

Binary searching program

#include <stdio.h>

int main()

{

int c, first, last, middle, n, search, a[100];

printf("Enter number of elements\n");

scanf("%d",&n);

printf("Enter %d integers\n", n);

for ( c = 0 ; c < n ; c++ )

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

printf("Enter value to find\n");

scanf("%d",&search);

first = 0;

last = n - 1;

middle = (first+last)/2;

while( first <= last )

{

if ( a[middle] < search )

first = middle + 1;

else if ( a[middle] == search )

{

printf("%d found at location %d.\n", search, middle+1);

break;

}

else

last = middle - 1;

middle = (first + last)/2;

}

if ( first > last )

printf("Not found! %d is not present in the list.\n", search);

return 0;

}


                              

BUBBLE SOTR:-------


#include <stdio.h>

int main()
{
  int array[100], n, c, d, swap;

  printf("Enter number of elements\n");
  scanf("%d", &n);

  printf("Enter %d integers\n", n);

  for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

  for (c = 0 ; c < ( n - 1 ); c++)
  {
    for (d = 0 ; d < n - c - 1; d++)
    {
      if (array[d] > array[d+1]) /* For decreasing order use < */
      {
        swap       = array[d];
        array[d]   = array[d+1];
        array[d+1] = swap;
      }
    }
  }

  printf("Sorted list in ascending order:\n");

  for ( c = 0 ; c < n ; c++ )
     printf("%d\n", array[c]);

  return 0;
}


OUT PUT:---

linear search

//linear search
#include <stdio.h>
int main()
{
   int array[100], search, i, n;

   printf("Enter the number of elements in array\n");
   scanf("%d",&n);

   printf("Enter %d elements:\n", n);

   for (i= 0; i< n; i++)
      scanf("%d", &array[i]);

   printf("Enter the number to search\n");
   scanf("%d", &search);

   for (i= 0; i< n; i++)
   {
      if (array[i] == search)     /* if required element found */
      {
         printf("%d is present at location %d.\n", search, i+1);
         break;
      }
   }
   if (i==n)
      printf("%d is not present in array.\n", search);

   return 0;
}


OUTPUT

Enter the number of elements in array
5
Enter 5 elements:
1
2
3
4
5
Enter the number to search
5
5 is present at location 5.

 

/* Bubble sort code */

#include <stdio.h>
#include<conio.h>

int main()
{
  int array[100], n, c, d, swap;

  printf("Enter number of elements\n");
  scanf("%d", &n);

  printf("Enter %d integers\n", n);

  for (c = 0; c < n; c++)
    scanf("%d", &array[c]);

  for (c = 0 ; c < ( n - 1 ); c++)
  {
    for (d = 0 ; d < n - c - 1; d++)
    {
      if (array[d] > array[d+1]) /* For decreasing order use < */
      {
        swap       = array[d];
        array[d]   = array[d+1];
        array[d+1] = swap;
      }
    }
  }

  printf("Sorted list in ascending order:\n");

  for ( c = 0 ; c < n ; c++ )
     printf("%d\n", array[c]);
 getch();
  return 0;
}



                                                   output

SEARVHING:---


#include <stdio.h>

int main()
{
   int c, first, last, middle, n, search, array[100];

   printf("Enter number of elements\n");
   scanf("%d",&n);

   printf("Enter %d integers\n", n);

   for ( c = 0 ; c < n ; c++ )
      scanf("%d",&array[c]);

   printf("Enter value to find\n");
   scanf("%d",&search);

   first = 0;
   last = n - 1;
   middle = (first+last)/2;

   while( first <= last )
   {
      if ( array[middle] < search )
         first = middle + 1;  
      else if ( array[middle] == search )
      {
         printf("%d found at location %d.\n", search, middle+1);
         break;
      }
      else
         last = middle - 1;

      middle = (first + last)/2;
   }
   if ( first > last )
      printf("Not found! %d is not present in the list.\n", search);

   return 0;  
}

OUT PUT:--

#include<stdio.h>

 

int main() {

   int a[30], ele, num, i;

 

   printf("\nEnter no of elements :");

   scanf("%d", &num);

 

   printf("\nEnter the values :");

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

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

   }

 

   //Read the element to be searched

   printf("\nEnter the elements to be searched :");

   scanf("%d", &ele);

 

   //Search starts from the zeroth location

   i = 0;

   while (i < num && ele != a[i]) {

      i++;

   }

 

   //If i < num then Match found

   if (i < num) {

      printf("Number found at the location = %d", i + 1);

   } else {

      printf("Number not found");

   }

 

   return (0);

}