Hashing

-

#include <stdio.h>

  

  

void selection(int data[], int n, int stu[]) {  

    int i, j, small;  

      

    for (i = 1; i < n; i++) {  

        small = i; //minimum element in unsorted array  

          

        for (j = i; j <= n; j++) { 

        if (data[j] < data[small]) {

            small = j;  

        }

   }

   int temp = data[small];  

    data[small] = data[i];  

    data[i] = temp;

   


    temp = stu[small];  

    stu[small] = stu[i];  

    stu[i] = temp;

   

  

    }  

}  

 

int main() {


int n ;

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

scanf("%d",&n);

int i, j, at[n] , pt[n] , data[n];

int stu[n];

printf("enter arrival time and preparation time for\n");


for(i = 1 ; i <= n ; i++){

    printf("student %d - \n", i);

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

    data[i]= at[i]+ pt[i];

    stu[i] = i ;

}

selection(data , n,stu);


printf("order is\n");


for(i = 1 ; i <= n ; i++){

    printf("%d\t" , stu[i]);

}


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