DS practical 8

-

 DS practical 8


#include <stdio.h>

struct Employee

{

  char employee_name[50];

  int emp_no;

  int emp_salary;

};

int count=0;

int binarySearch(int num,struct Employee ar[],int n)

{

    int mid;

    int l=n-1,f=0;

    while(f<=l)

    {

        count++;

        mid=(f+l)/2;

        if(ar[mid].emp_no==num)

        return mid;

        else if(ar[mid].emp_no<num)

        {

            f=mid+1;

        }

          else if(ar[mid].emp_no>num)

        {

            l=mid-1;

        }

    }

        return -1;

}

int main()

{

    int n,i,number;

    printf("Enter number of employees: ");

    scanf("%d",&n);

    struct Employee emp[n];

    fflush(stdin);

    printf("Enter information: \n");

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

    {

        printf("Employee %d:\nName:",i+1);

        scanf("%s",emp[i].employee_name);

        while(getchar()!='\n');

        printf("Emp no: ");

        scanf("%d",&emp[i].emp_no);

        printf("Salary: ");

        scanf("%d",&emp[i].emp_salary);

    }

    printf("Enter Emp no to be searched: ");

    scanf("%d",&number);

    int ans=binarySearch(number,emp,n);

    printf("The Employee searched is at position: %d",ans);

 printf("Number of comparisons performed is %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