Question

struct student { char name[10]; int rank; };

Using the student structure given above, create an array of size 5 students..

Then write a complete C program to sort the students array based on the students rank. Use the following sorting techniques in your code. Don’t forget to print initial array and final (sorted) array. a. Selection sort b. Insertion sort c. Merge sort / Quick sort.

Answer 1

A) using selection sort

#include<stdio.h>
//main starts from here
int main()
{
    int i,min,j;
   
    //structure for student data
    struct student
    {
        char name[20];
        int rank;
    }s[5],temp;
    printf("\nEnter the student's information\n");
    //taking input for student information
    for(i =0;i<5;i++)
    {
        printf("Enter student name: ");
        scanf("%s",&s[i].name);
       
        printf("Enter student rank: ");
        scanf("%d",&s[i].rank);  
    }
    //selection sort
    for (i = 0; i < 4; i++)
    {
        // Find the minimum element in unsorted array
        min = i;
        for (j = i+1; j < 5; j++)
        if (s[j].rank < s[min].rank)
        min = j;
        // Swap the found minimum element with the first element
        temp = s[min];
        s[min] = s[i];
        s[i] = temp;
     }
   
    printf("\nDisplay the student's information\n");
    //Displays the student information
    for(i =0;i<5;i++)
    {    
        printf("\nName: %s",s[i].name);        
        printf("\nRank : %d",s[i].rank);
       
    }
    return 0;
}

INSERTION SORT :

#include<stdio.h>
//main starts from here
int main()
{
    int i,key,j;
   
    //structure for student data
    struct student
    {
        char name[20];
        int rank;
    }s[5],temp;
    printf("\nEnter the student's information\n");
    //taking input for student information
    for(i =0;i<5;i++)
    {
        printf("Enter student name: ");
        scanf("%s",&s[i].name);
       
        printf("Enter student rank: ");
        scanf("%d",&s[i].rank);  
    }
    //Insertion sort
    for (i = 1; i < 5; i++)
    {
        key = s[i].rank;
        j = i - 1;
        while (j >= 0 && s[j].rank > key)
        {
            s[j + 1].rank = s[j].rank;
            j = j - 1;
        }
        s[j + 1].rank = key;
    }

    printf("\nDisplay the student's information\n");
    //Displays the student information
    for(i =0;i<5;i++)
    {    
        printf("\nName: %s",s[i].name);        
        printf("\nRank : %d",s[i].rank);
       
    }
    return 0;
}

QUICK SORT:

#include<stdio.h>

struct student
    {
        char name[20];
        int rank;
    }s[5],temp;

void quick_sort(struct student s[],int first,int last)
{
    int i, j, pivot;
    if(first<last)
    {
        pivot=first;
        i=first;
        j=last;
        while(i<j)
        {
            while(s[i].rank <= s[pivot].rank &&i<last)
             i++;
            while(s[j].rank>s[pivot].rank)
             j--;
            if(i<j)
            {
                temp=s[i];
                s[i]=s[j];
                s[j]=temp;
             }
        }
        temp=s[pivot];
        s[pivot]=s[j];
        s[j]=temp;
        quick_sort(s,first,j-1);
        quick_sort(s,j+1,last);
     }
}
//main starts from here
int main()
{
    int i,key,j;
   
    //structure for student data
   
    printf("\nEnter the student's information\n");
    //taking input for student information
    for(i =0;i<5;i++)
    {
        printf("Enter student name: ");
        scanf("%s",&s[i].name);
       
        printf("Enter student rank: ");
        scanf("%d",&s[i].rank);  
    }
    quick_sort(s,0,4);
   

    printf("\nDisplay the student's information\n");
    //Displays the student information
    for(i =0;i<5;i++)
    {    
        printf("\nName: %s",s[i].name);        
        printf("\nRank : %d",s[i].rank);
       
    }
    return 0;
}