Practical 7 by Karan

-

 // Quick sort in C


#include <stdio.h>

#include <stdlib.h>

#include <string.h>


 struct student {

char name[20];

int rollno;

int mark;


} ;


// function to find the partition position

int partition(struct student array[], int low, int high) {

  

  // select the rightmost element as pivot

  int pivot = array[high].rollno;

  

  // pointer for greater element

  int i = (low - 1);


  // traverse each element of the array

  // compare them with the pivot

  for (int j = low; j < high; j++) {

    if (array[j].rollno<= pivot) {

        

      // if element smaller than pivot is found

      // swap it with the greater element pointed by i

      i++;

      

      // swap element at i with element at j

     

    struct student temp ;

     temp = array[i];

      array[i] = array[j];

  array[j] = temp ;

    }

  }

   // swap the pivot element with the greater element at i

  struct student temp ;

     temp = array[i+1];

      array[i+1] = array[high];

  array[high] = temp ;

 


  

  // return the partition point

  return (i + 1);

}


void quickSort(struct student array[], int low, int high) {

  if (low < high) {

    

  

    int pi = partition(array, low, high);

    

    // recursive call on the left of pivot

    quickSort(array, low, pi - 1);

    

    // recursive call on the right of pivot

    quickSort(array, pi + 1, high);

  }

}


// function to print array elements

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

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

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

    printf(" roll no = %d ", array[i].rollno);

     printf(" marks = %d ", array[i].mark);

    printf("\n");

  }

  printf("\n");

}


// main function

int main() {

  int no , i ;

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

  scanf("%d", &no);



  struct student data[no] ;


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

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

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


printf("Enter Rollno:");    

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

 

printf("Enter marks:");    

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

}    


  int n = sizeof(data) / sizeof(data[0]);

  printf("no of data is %d\n",n);

  printf("Unsorted Array\n");

  printArray(data, n);

  

  // perform quicksort on data

  quickSort(data, 0, n - 1);

  

  printf("Sorted array in ascending order: \n");

  printArray(data, n);

}

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