quicksort (personal)

-

 #include <stdio.h>


struct Student
{
   
    char student_name[50];
    int student_roll_no;
    int total_marks;
};

void swap(struct Student *a, struct Student *b)
{
    struct Student t = *a;
    *a = *b;
    *b = t;
}

int count = 1;

int partition(struct Student arr[], int low, int high)
{
    int pivot = arr[high].student_roll_no;
    int i = (low - 1);
    for (int j = low; j <= high - 1; j++)
    {
        if (arr[j].student_roll_no < pivot)
        {
            i++;
            swap(&arr[i], &arr[j]);
            count++;
        }
    }
    swap(&arr[i + 1], &arr[high]);
    return (i + 1);
}

void quickSort(struct Student arr[], int low, int high)
{
    if (low < high)
    {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

void printArray(struct Student arr[], int size)
{
    int i;
    for (i = 0; i < size; i++)
    {
        printf("%s \t%d \t%d\n", arr[i].student_name, arr[i].student_roll_no, arr[i].total_marks);
    }
}

int main()
{
    int n, i;
    printf("Enter number of students: ");
    scanf("%d", &n);
    struct Student stud[n];
    fflush(stdin);
    printf("Enter information: ");
   
    for (i = 0; i < n; i++)
    {
        printf("student %d:\nName:", i + 1);
        scanf("%s", stud[i].student_name);
        while (getchar() != '\n');
        printf("Roll no: ");
        scanf("%d", &stud[i].student_roll_no);
        printf(" total Marks: ");
        scanf("%d", &stud[i].total_marks);
    }

    quickSort(stud, 0, n - 1);
    printf("Sorted array: \n");
    printArray(stud, n);
    printf("Number of swap 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