Computer Science, asked by renu2201020, 5 hours ago

Write a menu driven program to implement Bubble Sort, Insertion Sort and Selection Sort on a given list of numbers.


python program​

Answers

Answered by panditchhathu403
2

Answer Program

#include<stdio.h>

#include<stdlib.h>

void display(int a[],int n);

void bubble_sort(int a[],int n);

void selection_sort(int a[],int n);

void insertion_sort(int a[],int n);

//-----------------Main Function----------------------

 

int main()

{

   int n,choice,i;

   char ch[20];

   printf("Enter no. of elements u want to sort : ");

   scanf("%d",&n);

   int arr[n];

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

   {

        printf("Enter %d Element : ",i+1);

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

   }

   printf("Please select any option Given Below for Sorting : \n");

 

while(1)

   {

 

    printf("\n1. Bubble Sort\n2. Selection Sort\n3. Insertion Sort\n4. Display Array.\n5. Exit the Program.\n");

    printf("\nEnter your Choice : ");

    scanf("%d",&choice);

 

    switch(choice)

    {

    case 1:

        bubble_sort(arr,n);

        break;

    case 2:

        selection_sort(arr,n);

        break;

    case 3:

        insertion_sort(arr,n);

        break;

    case 4:

 

        display(arr,n);

        break;

 

    case 5:

        return 0;

    default:

        printf("\nPlease Select only 1-5 option ----\n");

    }

}

return 0;

}

 

//-----------End of main function---------------------

 

//-------------------Display Function-----------------

 

void display(int arr[],int n)

{

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

   {

        printf(" %d ",arr[i]);

   }

 

}

 

//---------------------Bubble Sort Function-----------

 

void bubble_sort(int arr[],int n)

{

  int i,j,temp;

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

  {

      for(j=0;j<n-i-1;j++)

      {

          if(arr[j]>arr[j+1])

          {

             temp=arr[j];

             arr[j]=arr[j+1];

             arr[j+1]=temp;

          }

      }

  }

printf("After Bubble sort Elements are : ");

display(arr,n);

}

 

//------------------Selection Sort Function---------

 

void selection_sort(int arr[],int n)

{

    int i,j,temp;

    for(i=0;i<n-1;i++)

    {

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

        {

            if(arr[i]>arr[j])

            {

             temp=arr[i];

             arr[i]=arr[j];

             arr[j]=temp;

            }

        }

 

    }

printf("After Selection sort Elements are : ");

display(arr,n);

}

 

//---------------Insertion Sort Function-------------------

 

void insertion_sort(int arr[],int n)

{

    int i,j,min;

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

    {

        min=arr[i];

        j=i-1;

        while(min<arr[j] && j>=0)

        {

            arr[j+1]=arr[j];

            j=j-1;

        }

        arr[j+1]=min;

    }

printf("After Insertion sort Elements are : ");

display(arr,n);

Output

Hope this answer help you

Answered by zafaraltaf466
0

Answer:

And Rim loa ikftera lopi computer software for your home computer needs to

Similar questions