Practical 8 - NEW

-

 #include <stdio.h>

#include <string.h>


typedef struct Employee

{

 char Employee_name[20];

 int emp_no;

 float emp_salary;

} Employee;


void binarysearch(Employee s[], int num, int n)

{

 int count = 0;

 int first = 0;

 int last = n - 1;

 int flag = 0, mid;

 while (first <= last)

 {

  mid = (first + last) / 2;

  count++;

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

  {

   flag = 1;

   break;

  }

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

   first = mid + 1;

  else

   last = mid - 1;

 }


 if (flag == 1)

 {

  printf("\nRecord found");

  printf("\nName\tEmployee no.\tSalary\n");

  printf("-------------------------------");

  printf("\n%s\t %d\t\t%0.2f\n", s[mid].Employee_name, s[mid].emp_no, s[mid].emp_salary);

  printf("\nTotal comparisons happened = %d\n", count);

 }

 else

  printf("\nRecord not found");

 // return flag;

}


int main()

{

 int n;

 printf("Enter no. of Employees: ");

 scanf("%d", &n);

 Employee s[n];


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

 {

  printf("\nEnter Name, Employee no., Salary of Employee %d\n", i + 1);

  scanf("%s %d %f", s[i].Employee_name, &s[i].emp_no, &s[i].emp_salary);

 }


 int num;

 char ch;

 do

 {

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

  scanf("%d", &num);


  binarysearch(s, num, n);

  // if (binarysearch(s, num, n) == 1)

  // {

  // printf("\nRecord found");

  // printf("\nName\tEmployee no.\tSalary\n");

  // printf("-------------------------------");

  // printf("\n%s\t %d\t\t%0.2f\n", s[mid].Employee_name, s[mid].emp_no, s[mid].emp_salary);

  // printf("\nTotal comparisons happened = %d\n", count);

  // }

  // else

  // printf("\nRecord not found");


  printf("\nDo you want to search again?(y/n): ");

  scanf(" %c", &ch);


 } while (ch == 'y');


}

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