Practical 8 by Paxton

-

 #include<stdio.h>

struct emp

{

    char ename[20];

    int eno;

    char esal[7];

};

int main()

{

    struct emp e[10];

    int st,en,n,i=0,key=0,j=0,mid,flag=0,count=0;

    printf("No of employee u wish to enter:");

    scanf("%d",&n);

    printf("Start Entering the data:\n");

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

    {

        printf("Employee name:");

        scanf("%s",e[i].ename);

        printf("Employee no:");

        scanf("%d",&e[i].eno);

        printf("Enter sal of emp:");

        scanf("%s",e[i].esal);

    }

    printf("Your entered data:\n");

    printf("Employee name\tEmployee no\tSalary\n");

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

    {

        printf("%s\t\t",e[i].ename);

        printf("%d\t\t",e[i].eno);

        printf("%s",e[i].esal);

        printf("\n");

    }

    printf("Enter the Employee no to Search His/Her Details:");

    scanf("%d",&key);

    st=0;

    en=n-1;

    while(st!=mid && en!=mid)

    {

        mid=(st+en)/2;

        //printf("Mid:%d",mid);

        count=count+1;

        if(key==e[mid].eno)

        {

           flag=mid;

           //printf("Flag:%d",flag);

           break;

        }

        else if(key>e[mid].eno)

        {

            st=mid+1;

            //printf("st:%d",st);

        }

        else

        {

            en=mid-1;

            //printf("en:%d",en);

        }


    }

    if(flag==0)

    {

        printf("No such Employee Exist!");

    }

    else

    {

        printf("Employee name:%s\n",e[mid].ename);

        printf("Employee no:%d\n",e[mid].eno);

        printf("Enter sal of emp:%s\n",e[mid].esal);

    }

    printf("No of Comparisions:%d",count);

    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

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...
Read more