Practical 8 by Karan

-

 #include <stdio.h>

struct emp {

int no;

int sal;

char name[20];


};

 

int binarySearch(struct emp a[], int n, int x)

{

   

   int low=0, mid, high=n-1, count = 0;

   while(low <= high)

   {

       count++;

        mid = (low + high) / 2;

        if (x < a[mid].no)

            high = mid - 1;

        else if (x > a[mid].no)

         low = mid + 1;

       else {

        printf("no of search = %d\n",count);

      return mid;

       }

   }

return -1;



}

 

 void printArray(struct emp array[], int size) {

  for (int i = 0; i < size; ++i) {

     printf("name = %s\n",array[i].name);

    printf(" salary = %d\n ", array[i].sal);

     printf(" number = %d\n ", array[i].no);

    

  }

  printf("\n");

}



int main()

{

    int no , i,x ;

  printf("enter no of studets\n");

  scanf("%d", &no);



  struct emp data[no] ;


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

    printf("\nEnter Name of student %d:", (i+1));    

scanf("%s",&data[i].name);


printf("Enter number:");    

scanf("%d",&data[i].no);    

 

printf("Enter salary:");    

scanf("%d",&data[i].sal);    

}    

 printArray(data, no);

 printf("enter no to be searched \n");

 scanf("%d",&x);


    int result = binarySearch(data, no , x);

    if(result == -1)

         printf("Element is not present in array");

         else 

          printf("Employee is found at index %d", result);

    return 0;

}

Comments

Post a Comment

Popular posts from this blog

DAA P4 bfs, dfs

-
BFS #include < bits/stdc++.h > using namespace std ; class Graph {   int V ;   vector < list <int> > adj ; public :   Graph ( int V );   void addEdge ( int v , int w );   void BFS ( int s ); }; Graph :: Graph ( int V ) {   this -> V = V ;   adj . resize ( V ); } void Graph :: addEdge ( int v , int w ) {   adj [ v ] . push_back ( w ); } void Graph :: BFS ( int s ) {   vector <bool> visited ;   visited . resize ( V , false );   list <int> queue ;   visited [ s ] = true ;   queue . push_back ( s );   while ( ! queue . empty ()) {         s = queue . front ();     cout << s << " " ;     queue . pop_front ();     for ( auto adjacent : adj [ s ] ) {       if ( ! visited [ adjacent ] ) {         visited [ adjacent ] = true ;         q...
Read more

DAA P8 graph coloring

-
  Graph coloring // A C++ program to implement greedy algorithm for graph coloring #include < iostream > #include < list > using namespace std ; // A class that represents an undirected graph class Graph {   int V ; // No. of vertices   list <int> * adj ; // A dynamic array of adjacency lists public :   // Constructor and destructor   Graph ( int V ) { this -> V = V ; adj = new list <int> [ V ]; }   ~Graph ()   { delete [] adj ; }   // function to add an edge to graph   void addEdge ( int v , int w );   // Prints greedy coloring of the vertices   void greedyColoring (); }; void Graph :: addEdge ( int v , int w ) {   adj [ v ]. push_back ( w );   adj [ w ]. push_back ( v ); // Note: the graph is undirected } // Assigns colors (starting from 0) to all vertices and prints // the assignment of colors void Graph :: greedyColoring () {   int result [ V ];   //...
Read more